./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 38a2fba2a92db51b6a97ddc82d5dc9e2df7a8770315ef841bfaf5f0764404946 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 09:10:26,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 09:10:26,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 09:10:26,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 09:10:26,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 09:10:26,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 09:10:26,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 09:10:26,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 09:10:26,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 09:10:26,701 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 09:10:26,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 09:10:26,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 09:10:26,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 09:10:26,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 09:10:26,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 09:10:26,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 09:10:26,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 09:10:26,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 09:10:26,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 09:10:26,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 09:10:26,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 09:10:26,710 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 09:10:26,711 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 09:10:26,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 09:10:26,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 09:10:26,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 09:10:26,714 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 09:10:26,715 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 09:10:26,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 09:10:26,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 09:10:26,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 09:10:26,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 09:10:26,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 09:10:26,718 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 09:10:26,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 09:10:26,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 09:10:26,719 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 09:10:26,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 09:10:26,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 09:10:26,720 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 09:10:26,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 09:10:26,721 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-12-14 09:10:26,737 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 09:10:26,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 09:10:26,737 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 09:10:26,738 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 09:10:26,738 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 09:10:26,738 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 09:10:26,738 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 09:10:26,738 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 09:10:26,739 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 09:10:26,739 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 09:10:26,739 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 09:10:26,739 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 09:10:26,739 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 09:10:26,739 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 09:10:26,739 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 09:10:26,739 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 09:10:26,740 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 09:10:26,740 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 09:10:26,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 09:10:26,740 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 09:10:26,740 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 09:10:26,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 09:10:26,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 09:10:26,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 09:10:26,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 09:10:26,741 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 09:10:26,741 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 09:10:26,741 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 09:10:26,741 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 09:10:26,741 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 09:10:26,742 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 09:10:26,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 09:10:26,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 09:10:26,742 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 09:10:26,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:10:26,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 09:10:26,742 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 09:10:26,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 09:10:26,742 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 09:10:26,743 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 09:10:26,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 09:10:26,743 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 09:10:26,743 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 09:10:26,743 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 38a2fba2a92db51b6a97ddc82d5dc9e2df7a8770315ef841bfaf5f0764404946 [2022-12-14 09:10:26,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 09:10:26,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 09:10:26,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 09:10:26,927 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 09:10:26,928 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 09:10:26,929 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i [2022-12-14 09:10:29,549 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 09:10:29,767 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 09:10:29,768 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i [2022-12-14 09:10:29,779 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/data/4b82b5400/cce8f43fca874f419903d731b63722e7/FLAGfc6e04ca2 [2022-12-14 09:10:29,791 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/data/4b82b5400/cce8f43fca874f419903d731b63722e7 [2022-12-14 09:10:29,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 09:10:29,793 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 09:10:29,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 09:10:29,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 09:10:29,797 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 09:10:29,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:10:29" (1/1) ... [2022-12-14 09:10:29,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a133c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:29, skipping insertion in model container [2022-12-14 09:10:29,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:10:29" (1/1) ... [2022-12-14 09:10:29,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 09:10:29,838 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 09:10:30,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:10:30,141 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 09:10:30,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:10:30,212 INFO L208 MainTranslator]: Completed translation [2022-12-14 09:10:30,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:30 WrapperNode [2022-12-14 09:10:30,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 09:10:30,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 09:10:30,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 09:10:30,213 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 09:10:30,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:30" (1/1) ... [2022-12-14 09:10:30,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:30" (1/1) ... [2022-12-14 09:10:30,242 INFO L138 Inliner]: procedures = 165, calls = 76, calls flagged for inlining = 22, calls inlined = 4, statements flattened = 72 [2022-12-14 09:10:30,243 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 09:10:30,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 09:10:30,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 09:10:30,243 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 09:10:30,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:30" (1/1) ... [2022-12-14 09:10:30,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:30" (1/1) ... [2022-12-14 09:10:30,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:30" (1/1) ... [2022-12-14 09:10:30,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:30" (1/1) ... [2022-12-14 09:10:30,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:30" (1/1) ... [2022-12-14 09:10:30,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:30" (1/1) ... [2022-12-14 09:10:30,259 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:30" (1/1) ... [2022-12-14 09:10:30,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:30" (1/1) ... [2022-12-14 09:10:30,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 09:10:30,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 09:10:30,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 09:10:30,262 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 09:10:30,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:30" (1/1) ... [2022-12-14 09:10:30,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:10:30,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:10:30,284 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 09:10:30,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 09:10:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-12-14 09:10:30,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-12-14 09:10:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 09:10:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 09:10:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 09:10:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 09:10:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 09:10:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-14 09:10:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 09:10:30,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 09:10:30,414 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 09:10:30,415 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 09:10:30,550 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 09:10:30,580 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 09:10:30,580 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-14 09:10:30,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:10:30 BoogieIcfgContainer [2022-12-14 09:10:30,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 09:10:30,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 09:10:30,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 09:10:30,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 09:10:30,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 09:10:29" (1/3) ... [2022-12-14 09:10:30,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5105baa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:10:30, skipping insertion in model container [2022-12-14 09:10:30,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:30" (2/3) ... [2022-12-14 09:10:30,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5105baa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:10:30, skipping insertion in model container [2022-12-14 09:10:30,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:10:30" (3/3) ... [2022-12-14 09:10:30,589 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_3.i [2022-12-14 09:10:30,603 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 09:10:30,603 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-12-14 09:10:30,637 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 09:10:30,641 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@30ccd1f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 09:10:30,642 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-14 09:10:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 27 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:10:30,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 09:10:30,650 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:30,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:10:30,651 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 09:10:30,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:30,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1080968487, now seen corresponding path program 1 times [2022-12-14 09:10:30,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:30,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775290367] [2022-12-14 09:10:30,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:30,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:30,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:10:30,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:30,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775290367] [2022-12-14 09:10:30,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775290367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:30,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:10:30,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:10:30,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267555023] [2022-12-14 09:10:30,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:30,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:10:30,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:30,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:10:30,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:10:30,884 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 27 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 09:10:30,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:30,953 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2022-12-14 09:10:30,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:10:30,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2022-12-14 09:10:30,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:30,960 INFO L225 Difference]: With dead ends: 56 [2022-12-14 09:10:30,960 INFO L226 Difference]: Without dead ends: 48 [2022-12-14 09:10:30,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:10:30,964 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 25 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:30,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 103 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:10:30,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-12-14 09:10:30,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 31. [2022-12-14 09:10:30,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.55) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:10:30,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-12-14 09:10:30,992 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 8 [2022-12-14 09:10:30,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:30,992 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-12-14 09:10:30,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 09:10:30,993 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-12-14 09:10:30,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 09:10:30,993 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:30,993 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:10:30,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 09:10:30,994 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 09:10:30,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:30,994 INFO L85 PathProgramCache]: Analyzing trace with hash -532530515, now seen corresponding path program 1 times [2022-12-14 09:10:30,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:30,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652887863] [2022-12-14 09:10:30,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:30,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:31,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:10:31,113 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:31,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652887863] [2022-12-14 09:10:31,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652887863] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:10:31,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459411553] [2022-12-14 09:10:31,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:31,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:10:31,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:10:31,115 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:10:31,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 09:10:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:31,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 09:10:31,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:10:31,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:10:31,236 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:10:31,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459411553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:31,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 09:10:31,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-14 09:10:31,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638641895] [2022-12-14 09:10:31,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:31,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 09:10:31,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:31,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 09:10:31,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-14 09:10:31,239 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 09:10:31,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:31,292 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-12-14 09:10:31,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 09:10:31,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-12-14 09:10:31,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:31,294 INFO L225 Difference]: With dead ends: 48 [2022-12-14 09:10:31,294 INFO L226 Difference]: Without dead ends: 47 [2022-12-14 09:10:31,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-14 09:10:31,295 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 61 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:31,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 68 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:10:31,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-12-14 09:10:31,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2022-12-14 09:10:31,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.5) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:10:31,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-12-14 09:10:31,299 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 11 [2022-12-14 09:10:31,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:31,299 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-12-14 09:10:31,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 09:10:31,300 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-12-14 09:10:31,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 09:10:31,300 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:31,300 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:10:31,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 09:10:31,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-12-14 09:10:31,503 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 09:10:31,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:31,504 INFO L85 PathProgramCache]: Analyzing trace with hash 671423276, now seen corresponding path program 1 times [2022-12-14 09:10:31,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:31,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052813640] [2022-12-14 09:10:31,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:31,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:31,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:10:31,711 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:31,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052813640] [2022-12-14 09:10:31,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052813640] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:10:31,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859299490] [2022-12-14 09:10:31,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:31,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:10:31,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:10:31,713 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:10:31,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 09:10:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:31,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 09:10:31,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:10:31,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:10:31,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:10:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:10:31,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859299490] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:10:31,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1798568727] [2022-12-14 09:10:31,858 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-12-14 09:10:31,858 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:10:31,862 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:10:31,868 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:10:31,868 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:10:31,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 09:10:31,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-14 09:10:32,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:10:32,131 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:10:32,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 141 [2022-12-14 09:10:32,147 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:10:32,158 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 09:10:32,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 145 [2022-12-14 09:10:32,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:32,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:32,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:32,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:32,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:32,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:32,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:32,430 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 43 for LOIs [2022-12-14 09:10:32,463 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:10:33,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1798568727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:33,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:10:33,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 5, 5] total 18 [2022-12-14 09:10:33,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271499850] [2022-12-14 09:10:33,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:33,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 09:10:33,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:33,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 09:10:33,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2022-12-14 09:10:33,108 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 9 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 09:10:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:33,772 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-12-14 09:10:33,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 09:10:33,773 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-12-14 09:10:33,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:33,775 INFO L225 Difference]: With dead ends: 34 [2022-12-14 09:10:33,775 INFO L226 Difference]: Without dead ends: 33 [2022-12-14 09:10:33,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-12-14 09:10:33,776 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:33,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 109 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:10:33,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-12-14 09:10:33,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-12-14 09:10:33,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:10:33,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-12-14 09:10:33,781 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 12 [2022-12-14 09:10:33,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:33,782 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-12-14 09:10:33,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 09:10:33,782 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-12-14 09:10:33,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 09:10:33,782 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:33,782 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:10:33,787 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 09:10:33,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:10:33,984 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 09:10:33,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:33,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1667624743, now seen corresponding path program 1 times [2022-12-14 09:10:33,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:33,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307667729] [2022-12-14 09:10:33,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:33,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:34,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 09:10:34,039 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:34,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307667729] [2022-12-14 09:10:34,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307667729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:34,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:10:34,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:10:34,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424665427] [2022-12-14 09:10:34,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:34,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:10:34,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:34,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:10:34,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:10:34,041 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:10:34,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:34,066 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-12-14 09:10:34,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:10:34,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2022-12-14 09:10:34,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:34,068 INFO L225 Difference]: With dead ends: 50 [2022-12-14 09:10:34,068 INFO L226 Difference]: Without dead ends: 31 [2022-12-14 09:10:34,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:10:34,069 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 24 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:34,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 42 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:10:34,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-12-14 09:10:34,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-12-14 09:10:34,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 24 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:10:34,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-12-14 09:10:34,076 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 14 [2022-12-14 09:10:34,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:34,077 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-12-14 09:10:34,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:10:34,077 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-12-14 09:10:34,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 09:10:34,077 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:34,078 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:10:34,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 09:10:34,078 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 09:10:34,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:34,079 INFO L85 PathProgramCache]: Analyzing trace with hash -647673377, now seen corresponding path program 1 times [2022-12-14 09:10:34,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:34,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670549830] [2022-12-14 09:10:34,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:34,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:34,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 09:10:34,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:34,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670549830] [2022-12-14 09:10:34,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670549830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:34,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:10:34,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:10:34,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998622771] [2022-12-14 09:10:34,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:34,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:10:34,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:34,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:10:34,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:10:34,143 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:10:34,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:34,189 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-12-14 09:10:34,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:10:34,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-12-14 09:10:34,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:34,191 INFO L225 Difference]: With dead ends: 46 [2022-12-14 09:10:34,191 INFO L226 Difference]: Without dead ends: 42 [2022-12-14 09:10:34,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:10:34,192 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:34,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:10:34,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-12-14 09:10:34,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2022-12-14 09:10:34,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 09:10:34,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-12-14 09:10:34,202 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 17 [2022-12-14 09:10:34,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:34,202 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-12-14 09:10:34,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:10:34,203 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-12-14 09:10:34,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 09:10:34,203 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:34,203 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:10:34,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 09:10:34,204 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 09:10:34,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:34,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1893067609, now seen corresponding path program 1 times [2022-12-14 09:10:34,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:34,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747548550] [2022-12-14 09:10:34,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:34,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:34,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 09:10:34,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:34,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747548550] [2022-12-14 09:10:34,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747548550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:34,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:10:34,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:10:34,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760227278] [2022-12-14 09:10:34,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:34,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:10:34,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:34,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:10:34,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:10:34,261 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:10:34,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:34,299 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-12-14 09:10:34,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:10:34,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-12-14 09:10:34,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:34,300 INFO L225 Difference]: With dead ends: 43 [2022-12-14 09:10:34,300 INFO L226 Difference]: Without dead ends: 35 [2022-12-14 09:10:34,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:10:34,301 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:34,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 58 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:10:34,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-12-14 09:10:34,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-12-14 09:10:34,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 09:10:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-12-14 09:10:34,309 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 20 [2022-12-14 09:10:34,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:34,310 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-12-14 09:10:34,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:10:34,310 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-12-14 09:10:34,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 09:10:34,310 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:34,311 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:10:34,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 09:10:34,311 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 09:10:34,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:34,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1374365312, now seen corresponding path program 1 times [2022-12-14 09:10:34,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:34,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684637827] [2022-12-14 09:10:34,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:34,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:34,412 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 09:10:34,412 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:34,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684637827] [2022-12-14 09:10:34,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684637827] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:10:34,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63887384] [2022-12-14 09:10:34,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:34,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:10:34,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:10:34,414 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:10:34,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 09:10:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:34,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 09:10:34,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:10:34,514 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 09:10:34,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:10:34,549 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 09:10:34,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63887384] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:10:34,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1976321799] [2022-12-14 09:10:34,552 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 09:10:34,552 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:10:34,553 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:10:34,553 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:10:34,553 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:10:34,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 09:10:34,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-14 09:10:34,690 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:10:34,702 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 09:10:34,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 145 [2022-12-14 09:10:34,715 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:10:34,723 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:10:34,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 133 [2022-12-14 09:10:34,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:34,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:34,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:34,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:35,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:35,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:35,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:35,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:10:35,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 118 [2022-12-14 09:10:35,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:10:35,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 118 [2022-12-14 09:10:35,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:35,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 09:10:35,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 09:10:35,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 09:10:35,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 09:10:35,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:35,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:35,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:35,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:35,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:35,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:36,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:36,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:36,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:36,030 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 63 for LOIs [2022-12-14 09:10:36,096 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:10:37,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1976321799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:37,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:10:37,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6, 6, 6] total 25 [2022-12-14 09:10:37,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072469297] [2022-12-14 09:10:37,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:37,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 09:10:37,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:37,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 09:10:37,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2022-12-14 09:10:37,391 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 14 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:10:39,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:39,248 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-12-14 09:10:39,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 09:10:39,249 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-12-14 09:10:39,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:39,249 INFO L225 Difference]: With dead ends: 35 [2022-12-14 09:10:39,250 INFO L226 Difference]: Without dead ends: 32 [2022-12-14 09:10:39,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=201, Invalid=989, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 09:10:39,250 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 38 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:39,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 38 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 09:10:39,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-12-14 09:10:39,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-12-14 09:10:39,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 09:10:39,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-12-14 09:10:39,256 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 25 [2022-12-14 09:10:39,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:39,257 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-12-14 09:10:39,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:10:39,257 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-12-14 09:10:39,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 09:10:39,258 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:39,258 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:10:39,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 09:10:39,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:10:39,459 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 09:10:39,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:39,461 INFO L85 PathProgramCache]: Analyzing trace with hash 344348370, now seen corresponding path program 1 times [2022-12-14 09:10:39,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:39,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515878608] [2022-12-14 09:10:39,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:39,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:39,552 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 09:10:39,552 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:39,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515878608] [2022-12-14 09:10:39,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515878608] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:10:39,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481289737] [2022-12-14 09:10:39,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:39,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:10:39,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:10:39,554 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:10:39,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 09:10:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:39,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 09:10:39,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:10:39,648 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 09:10:39,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:10:39,681 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 09:10:39,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481289737] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:10:39,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [816227740] [2022-12-14 09:10:39,684 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 09:10:39,684 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:10:39,684 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:10:39,684 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:10:39,684 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:10:39,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 09:10:39,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-14 09:10:39,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:39,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:10:39,782 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 09:10:39,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 145 [2022-12-14 09:10:39,790 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:10:39,799 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:10:39,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 133 [2022-12-14 09:10:39,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:39,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:39,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:39,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:39,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:39,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:40,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:10:40,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 118 [2022-12-14 09:10:40,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:10:40,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 118 [2022-12-14 09:10:40,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:40,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 09:10:40,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 09:10:40,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 09:10:40,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 09:10:40,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:40,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:40,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:40,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:40,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:40,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:40,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:40,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:40,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:40,851 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 63 for LOIs [2022-12-14 09:10:40,898 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:10:42,511 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1233#(and (< 2147483646 |ULTIMATE.start_alloc_17_#t~post38#1|) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_alloc_17_~len#1| 10) (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) (<= 0 |~#ldv_global_msg_list~0.offset|) (<= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~len#1| 10) (<= 0 |ULTIMATE.start_alloc_17_~p~0#1.offset|) (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) (<= |ULTIMATE.start_entry_point_~len~0#1| 10) (<= |#NULL.offset| 0) (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) (<= 0 |ULTIMATE.start_entry_point_~array~0#1.offset|) (<= |~#ldv_global_msg_list~0.base| 1) (<= 10 |ULTIMATE.start_entry_point_~i~1#1|) (<= 10 |ULTIMATE.start_alloc_17_#in~len#1|) (<= |#NULL.base| 0) (<= |~#ldv_global_msg_list~0.offset| 0) (<= 10 |ULTIMATE.start_alloc_17_~len#1|) (<= 1 |~#ldv_global_msg_list~0.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-12-14 09:10:42,511 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:10:42,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:10:42,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-14 09:10:42,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230921812] [2022-12-14 09:10:42,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:10:42,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 09:10:42,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:42,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 09:10:42,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2022-12-14 09:10:42,514 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-14 09:10:42,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:42,602 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2022-12-14 09:10:42,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 09:10:42,602 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2022-12-14 09:10:42,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:42,603 INFO L225 Difference]: With dead ends: 60 [2022-12-14 09:10:42,603 INFO L226 Difference]: Without dead ends: 38 [2022-12-14 09:10:42,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2022-12-14 09:10:42,604 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 58 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:42,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 65 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:10:42,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-14 09:10:42,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-12-14 09:10:42,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 09:10:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-12-14 09:10:42,612 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 26 [2022-12-14 09:10:42,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:42,612 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-12-14 09:10:42,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-14 09:10:42,612 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-12-14 09:10:42,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 09:10:42,613 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:42,613 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:10:42,617 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 09:10:42,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:10:42,814 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 09:10:42,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:42,814 INFO L85 PathProgramCache]: Analyzing trace with hash 872222994, now seen corresponding path program 2 times [2022-12-14 09:10:42,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:42,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14691282] [2022-12-14 09:10:42,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:42,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:42,887 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-14 09:10:42,887 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:42,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14691282] [2022-12-14 09:10:42,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14691282] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:10:42,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250318638] [2022-12-14 09:10:42,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 09:10:42,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:10:42,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:10:42,888 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:10:42,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 09:10:42,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 09:10:42,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:10:42,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 09:10:42,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:10:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-14 09:10:42,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:10:43,020 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-14 09:10:43,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250318638] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:10:43,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [78047074] [2022-12-14 09:10:43,023 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 09:10:43,023 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:10:43,023 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:10:43,023 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:10:43,023 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:10:43,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-14 09:10:43,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 09:10:43,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:10:43,109 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:10:43,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 141 [2022-12-14 09:10:43,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:10:43,128 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 09:10:43,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 145 [2022-12-14 09:10:43,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:43,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:43,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:43,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:43,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:43,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:43,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:43,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:43,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:10:43,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 118 [2022-12-14 09:10:43,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:10:43,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 118 [2022-12-14 09:10:43,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 09:10:43,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 09:10:43,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 09:10:43,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 09:10:43,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:43,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:43,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:43,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:43,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:43,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:44,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:44,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:44,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:44,106 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 63 for LOIs [2022-12-14 09:10:44,165 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:10:45,590 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1581#(and (< 2147483646 |ULTIMATE.start_alloc_17_#t~post38#1|) (<= |ULTIMATE.start_alloc_17_~len#1| 10) (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~len#1| 10) (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) (= |~#ldv_global_msg_list~0.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) (= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= 10 |ULTIMATE.start_entry_point_~i~1#1|) (<= 10 |ULTIMATE.start_alloc_17_#in~len#1|) (= |~#ldv_global_msg_list~0.base| 1) (<= 10 |ULTIMATE.start_alloc_17_~len#1|) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 09:10:45,591 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:10:45,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:10:45,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-14 09:10:45,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198527487] [2022-12-14 09:10:45,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:10:45,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 09:10:45,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:45,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 09:10:45,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2022-12-14 09:10:45,592 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 09:10:45,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:45,717 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2022-12-14 09:10:45,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 09:10:45,718 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2022-12-14 09:10:45,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:45,718 INFO L225 Difference]: With dead ends: 78 [2022-12-14 09:10:45,719 INFO L226 Difference]: Without dead ends: 77 [2022-12-14 09:10:45,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2022-12-14 09:10:45,719 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 44 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:45,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 158 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:10:45,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-12-14 09:10:45,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 56. [2022-12-14 09:10:45,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 47 states have internal predecessors, (53), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 09:10:45,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2022-12-14 09:10:45,729 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 32 [2022-12-14 09:10:45,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:45,730 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2022-12-14 09:10:45,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 09:10:45,730 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-12-14 09:10:45,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 09:10:45,730 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:45,731 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:10:45,735 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 09:10:45,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:10:45,933 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 09:10:45,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:45,934 INFO L85 PathProgramCache]: Analyzing trace with hash 639008678, now seen corresponding path program 1 times [2022-12-14 09:10:45,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:45,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163664648] [2022-12-14 09:10:45,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:45,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:46,009 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-14 09:10:46,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:46,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163664648] [2022-12-14 09:10:46,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163664648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:46,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:10:46,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:10:46,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347734807] [2022-12-14 09:10:46,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:46,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:10:46,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:46,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:10:46,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:10:46,011 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:10:46,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:46,035 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2022-12-14 09:10:46,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:10:46,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2022-12-14 09:10:46,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:46,037 INFO L225 Difference]: With dead ends: 56 [2022-12-14 09:10:46,037 INFO L226 Difference]: Without dead ends: 55 [2022-12-14 09:10:46,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:10:46,037 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:46,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 32 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:10:46,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-14 09:10:46,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-12-14 09:10:46,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 46 states have internal predecessors, (52), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 09:10:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-12-14 09:10:46,048 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 34 [2022-12-14 09:10:46,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:46,048 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-12-14 09:10:46,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:10:46,049 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-12-14 09:10:46,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 09:10:46,050 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:46,050 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:10:46,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 09:10:46,050 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 09:10:46,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:46,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1665567357, now seen corresponding path program 1 times [2022-12-14 09:10:46,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:46,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575349431] [2022-12-14 09:10:46,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:46,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:46,162 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 09:10:46,162 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:46,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575349431] [2022-12-14 09:10:46,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575349431] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:10:46,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200744736] [2022-12-14 09:10:46,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:46,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:10:46,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:10:46,163 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:10:46,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 09:10:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:46,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 09:10:46,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:10:46,312 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 09:10:46,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:10:46,382 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 09:10:46,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200744736] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:10:46,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1441451186] [2022-12-14 09:10:46,385 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-12-14 09:10:46,385 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:10:46,385 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:10:46,385 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:10:46,385 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:10:46,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 09:10:46,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-14 09:10:46,459 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:10:46,471 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 09:10:46,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 145 [2022-12-14 09:10:46,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:10:46,488 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:10:46,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 133 [2022-12-14 09:10:46,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:46,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:46,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:46,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:46,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:46,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:46,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:46,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:46,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:46,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:46,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:10:46,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 118 [2022-12-14 09:10:46,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:10:46,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 118 [2022-12-14 09:10:46,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:46,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 09:10:46,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 09:10:47,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 09:10:47,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 09:10:47,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:47,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:47,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:47,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:47,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:47,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:47,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:47,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-12-14 09:10:47,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 09:10:47,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:47,590 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 63 for LOIs [2022-12-14 09:10:47,636 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:10:49,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1441451186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:49,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:10:49,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [10, 10, 10] total 40 [2022-12-14 09:10:49,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044560925] [2022-12-14 09:10:49,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:49,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 09:10:49,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:49,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 09:10:49,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1319, Unknown=0, NotChecked=0, Total=1560 [2022-12-14 09:10:49,613 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:10:51,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:51,880 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-12-14 09:10:51,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 09:10:51,880 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-12-14 09:10:51,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:51,881 INFO L225 Difference]: With dead ends: 59 [2022-12-14 09:10:51,881 INFO L226 Difference]: Without dead ends: 58 [2022-12-14 09:10:51,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1218 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=373, Invalid=2383, Unknown=0, NotChecked=0, Total=2756 [2022-12-14 09:10:51,882 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 37 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:51,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 13 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 09:10:51,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-12-14 09:10:51,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-12-14 09:10:51,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 49 states have internal predecessors, (55), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 09:10:51,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-12-14 09:10:51,892 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 35 [2022-12-14 09:10:51,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:51,892 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-12-14 09:10:51,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:10:51,892 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-12-14 09:10:51,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 09:10:51,893 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:51,893 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:10:51,898 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 09:10:52,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-14 09:10:52,094 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 09:10:52,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:52,095 INFO L85 PathProgramCache]: Analyzing trace with hash 840162685, now seen corresponding path program 1 times [2022-12-14 09:10:52,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:52,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577451845] [2022-12-14 09:10:52,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:52,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 09:10:52,245 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:52,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577451845] [2022-12-14 09:10:52,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577451845] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:10:52,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004327067] [2022-12-14 09:10:52,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:52,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:10:52,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:10:52,247 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:10:52,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 09:10:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:52,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 09:10:52,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:10:52,406 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 09:10:52,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:10:52,468 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 09:10:52,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004327067] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:10:52,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1757359176] [2022-12-14 09:10:52,470 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-12-14 09:10:52,470 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:10:52,471 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:10:52,471 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:10:52,471 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:10:52,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-14 09:10:52,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 09:10:52,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:52,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:10:52,566 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:10:52,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 141 [2022-12-14 09:10:52,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:10:52,584 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 09:10:52,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 145 [2022-12-14 09:10:52,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:52,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:52,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:52,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:52,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:52,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:52,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:52,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:52,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:52,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:52,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 133 [2022-12-14 09:10:52,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 133 [2022-12-14 09:10:53,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 09:10:53,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 09:10:53,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 09:10:53,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 09:10:53,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:53,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:53,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:53,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:53,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:53,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:53,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:53,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-12-14 09:10:53,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 09:10:53,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:53,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:10:53,718 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:10:53,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 33 [2022-12-14 09:10:53,730 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 09:10:53,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 09:10:53,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:53,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:10:53,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-12-14 09:10:53,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:53,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-12-14 09:10:53,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 09:10:53,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:53,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:53,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:53,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-12-14 09:10:53,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 09:10:53,857 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 63 for LOIs [2022-12-14 09:10:53,918 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:10:55,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1757359176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:55,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:10:55,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [10, 10, 10] total 40 [2022-12-14 09:10:55,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649641324] [2022-12-14 09:10:55,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:55,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 09:10:55,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:55,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 09:10:55,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1319, Unknown=0, NotChecked=0, Total=1560 [2022-12-14 09:10:55,732 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:10:57,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:57,964 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-12-14 09:10:57,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 09:10:57,964 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-12-14 09:10:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:57,965 INFO L225 Difference]: With dead ends: 58 [2022-12-14 09:10:57,965 INFO L226 Difference]: Without dead ends: 49 [2022-12-14 09:10:57,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=373, Invalid=2383, Unknown=0, NotChecked=0, Total=2756 [2022-12-14 09:10:57,966 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:57,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 09:10:57,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-12-14 09:10:57,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-12-14 09:10:57,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 09:10:57,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-12-14 09:10:57,974 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 38 [2022-12-14 09:10:57,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:57,974 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-12-14 09:10:57,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:10:57,975 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-12-14 09:10:57,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-14 09:10:57,975 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:57,975 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:10:57,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-14 09:10:58,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 09:10:58,177 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 09:10:58,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:58,178 INFO L85 PathProgramCache]: Analyzing trace with hash -400563057, now seen corresponding path program 3 times [2022-12-14 09:10:58,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:58,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850337973] [2022-12-14 09:10:58,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:58,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:58,344 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-14 09:10:58,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:58,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850337973] [2022-12-14 09:10:58,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850337973] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:10:58,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188624026] [2022-12-14 09:10:58,344 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 09:10:58,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:10:58,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:10:58,345 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:10:58,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 09:10:58,566 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 09:10:58,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:10:58,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 09:10:58,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:10:58,621 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-12-14 09:10:58,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:10:58,687 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-12-14 09:10:58,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188624026] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:10:58,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2051402246] [2022-12-14 09:10:58,689 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 09:10:58,689 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:10:58,689 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:10:58,689 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:10:58,689 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:10:58,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-14 09:10:58,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 09:10:58,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:10:58,772 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:10:58,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 141 [2022-12-14 09:10:58,779 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:10:58,787 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 09:10:58,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 145 [2022-12-14 09:10:58,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:58,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:58,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:58,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:58,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:58,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:58,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:59,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:59,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 133 [2022-12-14 09:10:59,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 133 [2022-12-14 09:10:59,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 09:10:59,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 09:10:59,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 09:10:59,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 09:10:59,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:59,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:59,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:59,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:59,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:59,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:59,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:59,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 09:10:59,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 09:10:59,670 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 63 for LOIs [2022-12-14 09:10:59,727 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:11:01,329 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3139#(and (< 2147483646 |ULTIMATE.start_alloc_17_#t~post38#1|) (<= |ULTIMATE.start_alloc_17_~len#1| 10) (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~len#1| 10) (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) (= |~#ldv_global_msg_list~0.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) (= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= 10 |ULTIMATE.start_entry_point_~i~1#1|) (<= 10 |ULTIMATE.start_alloc_17_#in~len#1|) (= |~#ldv_global_msg_list~0.base| 1) (<= 10 |ULTIMATE.start_alloc_17_~len#1|) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 09:11:01,329 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:11:01,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:11:01,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 18 [2022-12-14 09:11:01,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369691623] [2022-12-14 09:11:01,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:11:01,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 09:11:01,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:11:01,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 09:11:01,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=797, Unknown=0, NotChecked=0, Total=930 [2022-12-14 09:11:01,331 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 09:11:01,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:11:01,579 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2022-12-14 09:11:01,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 09:11:01,580 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 56 [2022-12-14 09:11:01,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:11:01,580 INFO L225 Difference]: With dead ends: 86 [2022-12-14 09:11:01,580 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 09:11:01,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 144 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=272, Invalid=1450, Unknown=0, NotChecked=0, Total=1722 [2022-12-14 09:11:01,581 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 52 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:11:01,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 45 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:11:01,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 09:11:01,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 09:11:01,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:11:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 09:11:01,582 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2022-12-14 09:11:01,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:11:01,582 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 09:11:01,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 09:11:01,582 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 09:11:01,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 09:11:01,584 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-12-14 09:11:01,584 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-12-14 09:11:01,584 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-12-14 09:11:01,585 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-12-14 09:11:01,585 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-12-14 09:11:01,585 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-12-14 09:11:01,585 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-12-14 09:11:01,585 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-12-14 09:11:01,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-14 09:11:01,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 09:11:01,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 09:11:03,277 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 525 531) the Hoare annotation is: (or (let ((.cse0 (not (= |#NULL.offset| 0))) (.cse1 (not (= |~#ldv_global_msg_list~0.offset| 0))) (.cse2 (not (= |#NULL.base| 0))) (.cse3 (not (= |~#ldv_global_msg_list~0.base| 1)))) (and (or .cse0 .cse1 (not (= |ldv_malloc_#in~size| 4)) .cse2 (not (<= 0 |#StackHeapBarrier|)) .cse3) (let ((.cse5 (select |#memory_$Pointer$.base| |~#ldv_global_msg_list~0.base|)) (.cse4 (select |#memory_$Pointer$.offset| |~#ldv_global_msg_list~0.base|)) (.cse6 (+ |~#ldv_global_msg_list~0.offset| 4))) (or (not (= (select |old(#valid)| 1) 1)) .cse0 (not (= 40 |ldv_malloc_#in~size|)) .cse1 (not (< 0 |#StackHeapBarrier|)) (not (= (select |old(#length)| 1) 8)) .cse2 (not (= (select .cse4 |~#ldv_global_msg_list~0.offset|) |~#ldv_global_msg_list~0.offset|)) (not (= |~#ldv_global_msg_list~0.base| (select .cse5 .cse6))) (not (= (select |old(#valid)| 0) 0)) (not (= |~#ldv_global_msg_list~0.base| (select .cse5 |~#ldv_global_msg_list~0.offset|))) (not (= |~#ldv_global_msg_list~0.offset| (select .cse4 .cse6))) .cse3)))) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-12-14 09:11:03,277 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-12-14 09:11:03,277 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 764) no Hoare annotation was computed. [2022-12-14 09:11:03,278 INFO L899 garLoopResultBuilder]: For program point L766(line 766) no Hoare annotation was computed. [2022-12-14 09:11:03,278 INFO L895 garLoopResultBuilder]: At program point alloc_17_err#1(lines 760 776) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse1 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse2 (= 10 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse3 (= |~#ldv_global_msg_list~0.base| 1)) (.cse4 (= |#NULL.offset| 0)) (.cse5 (<= 0 |#StackHeapBarrier|)) (.cse6 (= |#NULL.base| 0))) (or (and (<= 0 |ULTIMATE.start_entry_point_~i~1#1|) .cse0 .cse1 (= |ULTIMATE.start_alloc_17_~i~0#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= |ULTIMATE.start_alloc_17_~len#1| 10) (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) .cse0 (<= |ULTIMATE.start_alloc_17_#in~len#1| 10) (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) .cse1 (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0) .cse2 (< |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_~len#1|) (<= 10 |ULTIMATE.start_entry_point_~i~1#1|) (<= 10 |ULTIMATE.start_alloc_17_#in~len#1|) .cse3 (<= 10 |ULTIMATE.start_alloc_17_~len#1|) .cse4 .cse5 .cse6))) [2022-12-14 09:11:03,278 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 771) no Hoare annotation was computed. [2022-12-14 09:11:03,278 INFO L899 garLoopResultBuilder]: For program point L771(line 771) no Hoare annotation was computed. [2022-12-14 09:11:03,278 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 782) no Hoare annotation was computed. [2022-12-14 09:11:03,278 INFO L899 garLoopResultBuilder]: For program point L771-4(line 771) no Hoare annotation was computed. [2022-12-14 09:11:03,278 INFO L899 garLoopResultBuilder]: For program point L771-5(line 771) no Hoare annotation was computed. [2022-12-14 09:11:03,278 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 771) no Hoare annotation was computed. [2022-12-14 09:11:03,278 INFO L895 garLoopResultBuilder]: At program point L771-6(lines 771 774) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse2 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse3 (= 10 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse1 (+ |ULTIMATE.start_alloc_17_~j~0#1| 1)) (.cse4 (= |~#ldv_global_msg_list~0.base| 1)) (.cse5 (= |#NULL.offset| 0)) (.cse6 (<= 0 |#StackHeapBarrier|)) (.cse7 (= |#NULL.base| 0))) (or (and (<= |ULTIMATE.start_alloc_17_~len#1| 10) (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) .cse0 (<= |ULTIMATE.start_alloc_17_#in~len#1| 10) (<= 0 .cse1) (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) .cse2 (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0) .cse3 (< |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_~len#1|) (<= |ULTIMATE.start_alloc_17_~j~0#1| 9) (<= 10 |ULTIMATE.start_entry_point_~i~1#1|) (<= 10 |ULTIMATE.start_alloc_17_#in~len#1|) .cse4 (<= 10 |ULTIMATE.start_alloc_17_~len#1|) .cse5 .cse6 .cse7) (and (<= 0 |ULTIMATE.start_entry_point_~i~1#1|) .cse0 .cse2 (= |ULTIMATE.start_alloc_17_~i~0#1| 0) .cse3 (<= .cse1 0) .cse4 .cse5 .cse6 .cse7))) [2022-12-14 09:11:03,279 INFO L895 garLoopResultBuilder]: At program point L780(line 780) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#ldv_global_msg_list~0.base|)) (.cse1 (+ |~#ldv_global_msg_list~0.offset| 4)) (.cse2 (select |#memory_$Pointer$.offset| |~#ldv_global_msg_list~0.base|))) (and (= |~#ldv_global_msg_list~0.base| (select .cse0 |~#ldv_global_msg_list~0.offset|)) (= (select |#length| 1) 8) (= |~#ldv_global_msg_list~0.base| (select .cse0 .cse1)) (= |~#ldv_global_msg_list~0.offset| 0) (= 10 |ULTIMATE.start_entry_point_~len~0#1|) (= |~#ldv_global_msg_list~0.offset| (select .cse2 .cse1)) (= (select |#valid| 1) 1) (= |~#ldv_global_msg_list~0.base| 1) (= (select |#valid| 0) 0) (= |#NULL.offset| 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= (select .cse2 |~#ldv_global_msg_list~0.offset|) |~#ldv_global_msg_list~0.offset|))) [2022-12-14 09:11:03,279 INFO L899 garLoopResultBuilder]: For program point L780-1(line 780) no Hoare annotation was computed. [2022-12-14 09:11:03,279 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 782) no Hoare annotation was computed. [2022-12-14 09:11:03,279 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 09:11:03,279 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 771) no Hoare annotation was computed. [2022-12-14 09:11:03,279 INFO L899 garLoopResultBuilder]: For program point L764-3(line 764) no Hoare annotation was computed. [2022-12-14 09:11:03,279 INFO L899 garLoopResultBuilder]: For program point L764-4(line 764) no Hoare annotation was computed. [2022-12-14 09:11:03,279 INFO L895 garLoopResultBuilder]: At program point L764-5(lines 764 768) the Hoare annotation is: (and (let ((.cse0 (<= 0 |#NULL.base|)) (.cse1 (<= |ULTIMATE.start_alloc_17_~len#1| 10)) (.cse2 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0)) (.cse3 (<= 0 |~#ldv_global_msg_list~0.offset|)) (.cse4 (<= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse5 (<= |ULTIMATE.start_alloc_17_#in~len#1| 10)) (.cse6 (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0)) (.cse7 (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|)) (.cse8 (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|)) (.cse9 (<= |ULTIMATE.start_entry_point_~len~0#1| 10)) (.cse10 (<= |#NULL.offset| 0)) (.cse11 (<= 10 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse12 (<= 0 |ULTIMATE.start_entry_point_~array~0#1.offset|)) (.cse13 (<= |~#ldv_global_msg_list~0.base| 1)) (.cse14 (<= 10 |ULTIMATE.start_entry_point_~i~1#1|)) (.cse15 (<= 10 |ULTIMATE.start_alloc_17_#in~len#1|)) (.cse16 (<= |#NULL.base| 0)) (.cse17 (<= |~#ldv_global_msg_list~0.offset| 0)) (.cse18 (<= 10 |ULTIMATE.start_alloc_17_~len#1|)) (.cse19 (<= 1 |~#ldv_global_msg_list~0.base|)) (.cse20 (<= 0 |#NULL.offset|)) (.cse21 (<= 0 |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 |ULTIMATE.start_alloc_17_~p~0#1.offset|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) .cse12 .cse13 (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|) .cse8 .cse9 .cse10 .cse11 (<= |ULTIMATE.start_alloc_17_~i~0#1| 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) (< |ULTIMATE.start_alloc_17_~i~0#1| 2147483647)) [2022-12-14 09:11:03,279 INFO L899 garLoopResultBuilder]: For program point L781(lines 781 787) no Hoare annotation was computed. [2022-12-14 09:11:03,280 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 09:11:03,280 INFO L902 garLoopResultBuilder]: At program point alloc_17_returnLabel#1(lines 760 776) the Hoare annotation is: true [2022-12-14 09:11:03,280 INFO L899 garLoopResultBuilder]: For program point L777(lines 777 788) no Hoare annotation was computed. [2022-12-14 09:11:03,280 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 764) no Hoare annotation was computed. [2022-12-14 09:11:03,280 INFO L895 garLoopResultBuilder]: At program point L765(line 765) the Hoare annotation is: (and (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (= |~#ldv_global_msg_list~0.offset| 0) (let ((.cse0 (<= |ULTIMATE.start_alloc_17_~len#1| 10)) (.cse1 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0)) (.cse2 (<= |ULTIMATE.start_alloc_17_#in~len#1| 10)) (.cse3 (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0)) (.cse4 (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|)) (.cse5 (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|)) (.cse6 (<= 10 |ULTIMATE.start_entry_point_~i~1#1|)) (.cse7 (<= 10 |ULTIMATE.start_alloc_17_#in~len#1|)) (.cse8 (<= 10 |ULTIMATE.start_alloc_17_~len#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|) .cse5 (<= |ULTIMATE.start_alloc_17_~i~0#1| 0) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (<= 0 |ULTIMATE.start_alloc_17_~p~0#1.offset|) .cse3 .cse4 .cse5 (<= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|) .cse6 .cse7 .cse8))) (<= |ULTIMATE.start_entry_point_~len~0#1| 10) (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (< |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_~len#1|) (= |~#ldv_global_msg_list~0.base| 1) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) [2022-12-14 09:11:03,280 INFO L899 garLoopResultBuilder]: For program point L765-1(line 765) no Hoare annotation was computed. [2022-12-14 09:11:03,280 INFO L899 garLoopResultBuilder]: For program point L782-3(line 782) no Hoare annotation was computed. [2022-12-14 09:11:03,280 INFO L899 garLoopResultBuilder]: For program point L782-4(line 782) no Hoare annotation was computed. [2022-12-14 09:11:03,280 INFO L895 garLoopResultBuilder]: At program point L782-5(lines 782 784) the Hoare annotation is: (let ((.cse10 (select |#memory_$Pointer$.offset| |~#ldv_global_msg_list~0.base|))) (and (let ((.cse0 (= (select |#length| 1) 8)) (.cse1 (= (select |#valid| 1) 1)) (.cse2 (= |~#ldv_global_msg_list~0.base| 1)) (.cse3 (= (select |#valid| 0) 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_entry_point_~i~1#1| 0) .cse2 .cse3) (and .cse0 .cse1 (<= 1 |ULTIMATE.start_entry_point_~i~1#1|) .cse2 .cse3))) (= |#NULL.offset| 0) (let ((.cse11 (+ |~#ldv_global_msg_list~0.offset| 4)) (.cse12 (select |#memory_$Pointer$.base| |~#ldv_global_msg_list~0.base|))) (let ((.cse4 (= |~#ldv_global_msg_list~0.base| (select .cse12 |~#ldv_global_msg_list~0.offset|))) (.cse5 (= |~#ldv_global_msg_list~0.base| (select .cse12 .cse11))) (.cse6 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse7 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse8 (= 10 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse9 (= |~#ldv_global_msg_list~0.offset| (select .cse10 .cse11)))) (or (and .cse4 (= |ULTIMATE.start_entry_point_~array~0#1.base| 0) .cse5 .cse6 .cse7 .cse8 .cse9) (and (< |ULTIMATE.start_entry_point_~array~0#1.base| |#StackHeapBarrier|) .cse4 (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (* (mod |ULTIMATE.start_entry_point_~len~0#1| 1073741824) 4)) .cse5 .cse6 (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) 1) .cse7 .cse8 .cse9)))) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= (select .cse10 |~#ldv_global_msg_list~0.offset|) |~#ldv_global_msg_list~0.offset|))) [2022-12-14 09:11:03,281 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 771) no Hoare annotation was computed. [2022-12-14 09:11:03,283 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:11:03,285 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 09:11:03,297 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:11:03,297 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:11:03,298 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:11:03,298 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:11:03,298 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:11:03,298 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:11:03,298 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:11:03,299 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:11:03,299 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:11:03,299 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:11:03,299 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:11:03,300 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:11:03,300 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:11:03,300 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:11:03,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 09:11:03 BoogieIcfgContainer [2022-12-14 09:11:03,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 09:11:03,301 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 09:11:03,301 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 09:11:03,302 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 09:11:03,302 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:10:30" (3/4) ... [2022-12-14 09:11:03,304 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 09:11:03,308 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-12-14 09:11:03,310 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-12-14 09:11:03,311 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-12-14 09:11:03,311 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-14 09:11:03,327 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 <= i && array == 0) && ldv_global_msg_list == 0) && i == 0) && 10 == len) && ldv_global_msg_list == 1) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((((len <= 10 && array <= 0) && array == 0) && \old(len) <= 10) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && 0 <= array) && p == 0) && 10 == len) && i < len) && 10 <= i) && 10 <= \old(len)) && ldv_global_msg_list == 1) && 10 <= len) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-12-14 09:11:03,327 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((len <= 10 && array <= 0) && array == 0) && \old(len) <= 10) && 0 <= j + 1) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && 0 <= array) && p == 0) && 10 == len) && i < len) && j <= 9) && 10 <= i) && 10 <= \old(len)) && ldv_global_msg_list == 1) && 10 <= len) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((0 <= i && array == 0) && ldv_global_msg_list == 0) && i == 0) && 10 == len) && j + 1 <= 0) && ldv_global_msg_list == 1) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-12-14 09:11:03,327 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((0 <= #NULL && len <= 10) && array <= 0) && 0 <= ldv_global_msg_list) && array <= 0) && \old(len) <= 10) && 0 <= p) && array <= 0) && 0 <= array) && 0 <= array) && len <= 10) && #NULL <= 0) && 10 <= len) && p <= 0) && 0 <= array) && ldv_global_msg_list <= 1) && 1 <= i) && 10 <= i) && 10 <= \old(len)) && #NULL <= 0) && ldv_global_msg_list <= 0) && 10 <= len) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) || (((((((((((((((((((((((0 <= #NULL && len <= 10) && array <= 0) && 0 <= ldv_global_msg_list) && array <= 0) && \old(len) <= 10) && array <= 0) && 0 <= array) && 0 <= i) && 0 <= array) && len <= 10) && #NULL <= 0) && 10 <= len) && i <= 0) && 0 <= array) && ldv_global_msg_list <= 1) && 10 <= i) && 10 <= \old(len)) && #NULL <= 0) && ldv_global_msg_list <= 0) && 10 <= len) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown)) && i < 2147483647 [2022-12-14 09:11:03,334 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 09:11:03,334 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 09:11:03,334 INFO L158 Benchmark]: Toolchain (without parser) took 33540.87ms. Allocated memory was 113.2MB in the beginning and 169.9MB in the end (delta: 56.6MB). Free memory was 79.5MB in the beginning and 66.4MB in the end (delta: 13.1MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. [2022-12-14 09:11:03,334 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 113.2MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 09:11:03,335 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.18ms. Allocated memory is still 113.2MB. Free memory was 79.2MB in the beginning and 57.5MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-14 09:11:03,335 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.86ms. Allocated memory is still 113.2MB. Free memory was 57.5MB in the beginning and 55.1MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 09:11:03,335 INFO L158 Benchmark]: Boogie Preprocessor took 17.96ms. Allocated memory is still 113.2MB. Free memory was 55.1MB in the beginning and 53.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 09:11:03,335 INFO L158 Benchmark]: RCFGBuilder took 320.95ms. Allocated memory was 113.2MB in the beginning and 140.5MB in the end (delta: 27.3MB). Free memory was 53.8MB in the beginning and 104.9MB in the end (delta: -51.1MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2022-12-14 09:11:03,335 INFO L158 Benchmark]: TraceAbstraction took 32716.64ms. Allocated memory was 140.5MB in the beginning and 169.9MB in the end (delta: 29.4MB). Free memory was 104.2MB in the beginning and 69.5MB in the end (delta: 34.6MB). Peak memory consumption was 99.0MB. Max. memory is 16.1GB. [2022-12-14 09:11:03,336 INFO L158 Benchmark]: Witness Printer took 32.56ms. Allocated memory is still 169.9MB. Free memory was 69.5MB in the beginning and 66.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 09:11:03,337 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 113.2MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.18ms. Allocated memory is still 113.2MB. Free memory was 79.2MB in the beginning and 57.5MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.86ms. Allocated memory is still 113.2MB. Free memory was 57.5MB in the beginning and 55.1MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.96ms. Allocated memory is still 113.2MB. Free memory was 55.1MB in the beginning and 53.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 320.95ms. Allocated memory was 113.2MB in the beginning and 140.5MB in the end (delta: 27.3MB). Free memory was 53.8MB in the beginning and 104.9MB in the end (delta: -51.1MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * TraceAbstraction took 32716.64ms. Allocated memory was 140.5MB in the beginning and 169.9MB in the end (delta: 29.4MB). Free memory was 104.2MB in the beginning and 69.5MB in the end (delta: 34.6MB). Peak memory consumption was 99.0MB. Max. memory is 16.1GB. * Witness Printer took 32.56ms. Allocated memory is still 169.9MB. Free memory was 69.5MB in the beginning and 66.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 782]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 782]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 764]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 764]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 771]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 771]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 771]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 771]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 32.7s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 422 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 413 mSDsluCounter, 786 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 569 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1189 IncrementalHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 217 mSDtfsCounter, 1189 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 804 GetRequests, 511 SyntacticMatches, 23 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3855 ImplicationChecksByTransitivity, 17.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=11, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 67 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 21 PreInvPairs, 40 NumberOfFragments, 780 HoareAnnotationTreeSize, 21 FomulaSimplifications, 1097 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 5632 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 563 NumberOfCodeBlocks, 554 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 759 ConstructedInterpolants, 0 QuantifiedInterpolants, 1635 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1470 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 28 InterpolantComputations, 6 PerfectInterpolantSequences, 478/637 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 4.8s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 8, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 87, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 143, TOOLS_POST_TIME: 2.6s, TOOLS_POST_CALL_APPLICATIONS: 45, TOOLS_POST_CALL_TIME: 1.0s, TOOLS_POST_RETURN_APPLICATIONS: 38, TOOLS_POST_RETURN_TIME: 0.5s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 226, TOOLS_QUANTIFIERELIM_TIME: 4.1s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 318, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 54, DOMAIN_JOIN_TIME: 0.4s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 11, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 19, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 87, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 8, LOOP_SUMMARIZER_CACHE_MISSES: 8, LOOP_SUMMARIZER_OVERALL_TIME: 2.6s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 2.6s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 19, CALL_SUMMARIZER_APPLICATIONS: 38, CALL_SUMMARIZER_CACHE_MISSES: 4, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 1375, DAG_COMPRESSION_RETAINED_NODES: 243, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 771]: Loop Invariant Derived loop invariant: (((((((((((((((((((((len <= 10 && array <= 0) && array == 0) && \old(len) <= 10) && 0 <= j + 1) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && 0 <= array) && p == 0) && 10 == len) && i < len) && j <= 9) && 10 <= i) && 10 <= \old(len)) && ldv_global_msg_list == 1) && 10 <= len) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((0 <= i && array == 0) && ldv_global_msg_list == 0) && i == 0) && 10 == len) && j + 1 <= 0) && ldv_global_msg_list == 1) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 764]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((0 <= #NULL && len <= 10) && array <= 0) && 0 <= ldv_global_msg_list) && array <= 0) && \old(len) <= 10) && 0 <= p) && array <= 0) && 0 <= array) && 0 <= array) && len <= 10) && #NULL <= 0) && 10 <= len) && p <= 0) && 0 <= array) && ldv_global_msg_list <= 1) && 1 <= i) && 10 <= i) && 10 <= \old(len)) && #NULL <= 0) && ldv_global_msg_list <= 0) && 10 <= len) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) || (((((((((((((((((((((((0 <= #NULL && len <= 10) && array <= 0) && 0 <= ldv_global_msg_list) && array <= 0) && \old(len) <= 10) && array <= 0) && 0 <= array) && 0 <= i) && 0 <= array) && len <= 10) && #NULL <= 0) && 10 <= len) && i <= 0) && 0 <= array) && ldv_global_msg_list <= 1) && 10 <= i) && 10 <= \old(len)) && #NULL <= 0) && ldv_global_msg_list <= 0) && 10 <= len) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown)) && i < 2147483647 - InvariantResult [Line: 760]: Loop Invariant Derived loop invariant: ((((((((0 <= i && array == 0) && ldv_global_msg_list == 0) && i == 0) && 10 == len) && ldv_global_msg_list == 1) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((((len <= 10 && array <= 0) && array == 0) && \old(len) <= 10) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && 0 <= array) && p == 0) && 10 == len) && i < len) && 10 <= i) && 10 <= \old(len)) && ldv_global_msg_list == 1) && 10 <= len) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 782]: Loop Invariant [2022-12-14 09:11:03,349 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:11:03,349 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:11:03,349 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:11:03,349 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:11:03,350 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:11:03,350 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:11:03,350 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:11:03,351 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:11:03,351 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:11:03,351 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:11:03,351 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:11:03,352 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:11:03,352 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:11:03,352 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((unknown-#length-unknown[1] == 8 && \valid[1] == 1) && i == 0) && ldv_global_msg_list == 1) && \valid[0] == 0) || ((((unknown-#length-unknown[1] == 8 && \valid[1] == 1) && 1 <= i) && ldv_global_msg_list == 1) && \valid[0] == 0)) && #NULL == 0) && (((((((ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list] && array == 0) && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list + 4]) && array == 0) && ldv_global_msg_list == 0) && 10 == len) && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list + 4]) || ((((((((array < unknown-#StackHeapBarrier-unknown && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list]) && unknown-#length-unknown[array] == len % 1073741824 * 4) && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list + 4]) && array == 0) && \valid[array] == 1) && ldv_global_msg_list == 0) && 10 == len) && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list + 4]))) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list] == ldv_global_msg_list - InvariantResult [Line: 760]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-12-14 09:11:03,362 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bd07b78-9b96-4160-b0ca-58e407091d53/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE