./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:48:29,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:48:29,615 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Overflow-32bit-Taipan_Default.epf [2024-11-14 04:48:29,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:48:29,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:48:29,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:48:29,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:48:29,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:48:29,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:48:29,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:48:29,673 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:48:29,674 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:48:29,674 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:48:29,674 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:48:29,674 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:48:29,674 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:48:29,675 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:48:29,675 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:48:29,675 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:48:29,675 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:48:29,675 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:48:29,675 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:48:29,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:48:29,676 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:48:29,676 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:48:29,676 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:48:29,676 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:48:29,676 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:48:29,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:48:29,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:48:29,676 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:48:29,677 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:48:29,677 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-14 04:48:29,677 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 04:48:29,677 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:48:29,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:48:29,677 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:48:29,677 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:48:29,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:48:29,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:48:29,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:48:29,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:48:29,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:48:29,678 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:48:29,679 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:48:29,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:48:29,679 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:48:29,679 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:48:29,679 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:48:29,679 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2024-11-14 04:48:30,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:48:30,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:48:30,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:48:30,039 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:48:30,039 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:48:30,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i Unable to find full path for "g++" [2024-11-14 04:48:31,917 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:48:32,305 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:48:32,306 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i [2024-11-14 04:48:32,336 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/data/6708d3d93/d0ff131e39b74c4a8c749b6251d096e0/FLAG8feede6b0 [2024-11-14 04:48:32,361 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/data/6708d3d93/d0ff131e39b74c4a8c749b6251d096e0 [2024-11-14 04:48:32,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:48:32,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:48:32,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:48:32,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:48:32,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:48:32,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:48:32" (1/1) ... [2024-11-14 04:48:32,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f16aabe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:32, skipping insertion in model container [2024-11-14 04:48:32,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:48:32" (1/1) ... [2024-11-14 04:48:32,441 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:48:33,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:48:33,114 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:48:33,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:48:33,290 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:48:33,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:33 WrapperNode [2024-11-14 04:48:33,291 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:48:33,292 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:48:33,292 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:48:33,292 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:48:33,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:33" (1/1) ... [2024-11-14 04:48:33,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:33" (1/1) ... [2024-11-14 04:48:33,401 INFO L138 Inliner]: procedures = 176, calls = 326, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1521 [2024-11-14 04:48:33,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:48:33,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:48:33,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:48:33,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:48:33,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:33" (1/1) ... [2024-11-14 04:48:33,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:33" (1/1) ... [2024-11-14 04:48:33,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:33" (1/1) ... [2024-11-14 04:48:33,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:33" (1/1) ... [2024-11-14 04:48:33,486 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:33" (1/1) ... [2024-11-14 04:48:33,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:33" (1/1) ... [2024-11-14 04:48:33,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:33" (1/1) ... [2024-11-14 04:48:33,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:33" (1/1) ... [2024-11-14 04:48:33,548 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:48:33,549 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:48:33,549 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:48:33,549 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:48:33,551 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:33" (1/1) ... [2024-11-14 04:48:33,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:48:33,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:48:33,593 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:48:33,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:48:33,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 04:48:33,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 04:48:33,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-14 04:48:33,630 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-14 04:48:33,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 04:48:33,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:48:33,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 04:48:33,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 04:48:33,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 04:48:33,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:48:33,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:48:33,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:48:33,953 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:48:33,956 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:48:36,230 INFO L? ?]: Removed 378 outVars from TransFormulas that were not future-live. [2024-11-14 04:48:36,231 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:48:38,241 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:48:38,241 INFO L316 CfgBuilder]: Removed 60 assume(true) statements. [2024-11-14 04:48:38,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:48:38 BoogieIcfgContainer [2024-11-14 04:48:38,242 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:48:38,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:48:38,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:48:38,252 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:48:38,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:48:32" (1/3) ... [2024-11-14 04:48:38,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755724e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:48:38, skipping insertion in model container [2024-11-14 04:48:38,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:48:33" (2/3) ... [2024-11-14 04:48:38,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755724e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:48:38, skipping insertion in model container [2024-11-14 04:48:38,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:48:38" (3/3) ... [2024-11-14 04:48:38,256 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test4-1.i [2024-11-14 04:48:38,275 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:48:38,276 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_nondet_test4-1.i that has 2 procedures, 118 locations, 1 initial locations, 35 loop locations, and 4 error locations. [2024-11-14 04:48:38,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:48:38,394 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@43701487, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:48:38,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-14 04:48:38,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 106 states have (on average 1.7358490566037736) internal successors, (184), 110 states have internal predecessors, (184), 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) [2024-11-14 04:48:38,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 04:48:38,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:48:38,407 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 04:48:38,408 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-14 04:48:38,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:48:38,414 INFO L85 PathProgramCache]: Analyzing trace with hash 46099201, now seen corresponding path program 1 times [2024-11-14 04:48:38,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:48:38,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343221636] [2024-11-14 04:48:38,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:48:38,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:48:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:48:38,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:48:38,595 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:48:38,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343221636] [2024-11-14 04:48:38,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343221636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:48:38,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:48:38,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 04:48:38,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755412237] [2024-11-14 04:48:38,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:48:38,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 04:48:38,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:48:38,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 04:48:38,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:48:38,628 INFO L87 Difference]: Start difference. First operand has 118 states, 106 states have (on average 1.7358490566037736) internal successors, (184), 110 states have internal predecessors, (184), 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) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2024-11-14 04:48:40,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:42,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:44,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:45,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:48:45,868 INFO L93 Difference]: Finished difference Result 233 states and 389 transitions. [2024-11-14 04:48:45,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:48:45,873 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2024-11-14 04:48:45,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:48:45,878 INFO L225 Difference]: With dead ends: 233 [2024-11-14 04:48:45,879 INFO L226 Difference]: Without dead ends: 114 [2024-11-14 04:48:45,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:48:45,884 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:48:45,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 3 Unknown, 0 Unchecked, 7.2s Time] [2024-11-14 04:48:45,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-14 04:48:45,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-14 04:48:45,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 104 states have (on average 1.1346153846153846) internal successors, (118), 106 states have internal predecessors, (118), 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) [2024-11-14 04:48:45,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2024-11-14 04:48:45,941 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 4 [2024-11-14 04:48:45,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:48:45,942 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2024-11-14 04:48:45,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2024-11-14 04:48:45,943 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2024-11-14 04:48:45,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 04:48:45,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:48:45,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 04:48:45,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 04:48:45,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-14 04:48:45,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:48:45,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1429075295, now seen corresponding path program 1 times [2024-11-14 04:48:45,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:48:45,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929564333] [2024-11-14 04:48:45,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:48:45,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:48:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-14 04:48:45,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1845400119] [2024-11-14 04:48:45,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:48:45,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:48:45,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:48:45,998 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:48:45,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 04:48:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:48:46,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 04:48:46,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:48:46,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:48:46,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:48:46,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:48:46,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929564333] [2024-11-14 04:48:46,275 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-14 04:48:46,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845400119] [2024-11-14 04:48:46,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845400119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:48:46,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:48:46,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:48:46,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170162016] [2024-11-14 04:48:46,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:48:46,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:48:46,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:48:46,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:48:46,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:48:46,278 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-14 04:48:48,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:50,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:52,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:54,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:56,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:57,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:48:59,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:00,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:02,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:05,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:07,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:49:07,290 INFO L93 Difference]: Finished difference Result 219 states and 251 transitions. [2024-11-14 04:49:07,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:49:07,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2024-11-14 04:49:07,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:49:07,294 INFO L225 Difference]: With dead ends: 219 [2024-11-14 04:49:07,294 INFO L226 Difference]: Without dead ends: 218 [2024-11-14 04:49:07,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:49:07,295 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 105 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:49:07,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 221 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 7 Unknown, 0 Unchecked, 21.0s Time] [2024-11-14 04:49:07,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-14 04:49:07,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 117. [2024-11-14 04:49:07,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 107 states have (on average 1.1308411214953271) internal successors, (121), 109 states have internal predecessors, (121), 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) [2024-11-14 04:49:07,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2024-11-14 04:49:07,309 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 5 [2024-11-14 04:49:07,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:49:07,310 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2024-11-14 04:49:07,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-14 04:49:07,310 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2024-11-14 04:49:07,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-14 04:49:07,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:49:07,312 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:49:07,326 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 04:49:07,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-14 04:49:07,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-14 04:49:07,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:49:07,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1045731315, now seen corresponding path program 1 times [2024-11-14 04:49:07,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:49:07,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275758930] [2024-11-14 04:49:07,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:49:07,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:49:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:49:08,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:49:08,385 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:49:08,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275758930] [2024-11-14 04:49:08,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275758930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:49:08,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:49:08,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:49:08,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290802016] [2024-11-14 04:49:08,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:49:08,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:49:08,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:49:08,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:49:08,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:49:08,387 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 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) [2024-11-14 04:49:10,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:12,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:14,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:16,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:18,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:20,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:22,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:24,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:26,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:28,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:49:28,209 INFO L93 Difference]: Finished difference Result 243 states and 277 transitions. [2024-11-14 04:49:28,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:49:28,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 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) Word has length 57 [2024-11-14 04:49:28,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:49:28,213 INFO L225 Difference]: With dead ends: 243 [2024-11-14 04:49:28,213 INFO L226 Difference]: Without dead ends: 131 [2024-11-14 04:49:28,214 INFO L431 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 [2024-11-14 04:49:28,215 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 4 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:49:28,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 207 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 9 Unknown, 0 Unchecked, 19.8s Time] [2024-11-14 04:49:28,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-14 04:49:28,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-14 04:49:28,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 121 states have (on average 1.1239669421487604) internal successors, (136), 123 states have internal predecessors, (136), 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) [2024-11-14 04:49:28,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 148 transitions. [2024-11-14 04:49:28,228 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 148 transitions. Word has length 57 [2024-11-14 04:49:28,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:49:28,229 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 148 transitions. [2024-11-14 04:49:28,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 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) [2024-11-14 04:49:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 148 transitions. [2024-11-14 04:49:28,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-14 04:49:28,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:49:28,231 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:49:28,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 04:49:28,231 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-14 04:49:28,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:49:28,232 INFO L85 PathProgramCache]: Analyzing trace with hash 201655462, now seen corresponding path program 1 times [2024-11-14 04:49:28,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:49:28,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419368028] [2024-11-14 04:49:28,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:49:28,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:49:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:49:28,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 04:49:28,854 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:49:28,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419368028] [2024-11-14 04:49:28,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419368028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:49:28,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:49:28,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:49:28,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414090512] [2024-11-14 04:49:28,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:49:28,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:49:28,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:49:28,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:49:28,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:49:28,857 INFO L87 Difference]: Start difference. First operand 131 states and 148 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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) [2024-11-14 04:49:30,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:32,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:34,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:36,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:39,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:41,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:43,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-14 04:49:43,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:49:43,760 INFO L93 Difference]: Finished difference Result 291 states and 332 transitions. [2024-11-14 04:49:43,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:49:43,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 70 [2024-11-14 04:49:43,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:49:43,766 INFO L225 Difference]: With dead ends: 291 [2024-11-14 04:49:43,767 INFO L226 Difference]: Without dead ends: 179 [2024-11-14 04:49:43,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:49:43,768 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 23 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:49:43,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 207 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 5 Unknown, 0 Unchecked, 14.9s Time] [2024-11-14 04:49:43,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-14 04:49:43,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-14 04:49:43,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 166 states have (on average 1.1144578313253013) internal successors, (185), 168 states have internal predecessors, (185), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-14 04:49:43,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 203 transitions. [2024-11-14 04:49:43,804 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 203 transitions. Word has length 70 [2024-11-14 04:49:43,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:49:43,805 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 203 transitions. [2024-11-14 04:49:43,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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) [2024-11-14 04:49:43,805 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 203 transitions. [2024-11-14 04:49:43,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-14 04:49:43,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:49:43,807 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:49:43,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 04:49:43,807 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-14 04:49:43,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:49:43,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1333199527, now seen corresponding path program 1 times [2024-11-14 04:49:43,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:49:43,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564977875] [2024-11-14 04:49:43,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:49:43,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:49:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:49:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-14 04:49:44,591 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:49:44,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564977875] [2024-11-14 04:49:44,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564977875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:49:44,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:49:44,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:49:44,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729427005] [2024-11-14 04:49:44,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:49:44,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:49:44,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:49:44,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:49:44,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:49:44,596 INFO L87 Difference]: Start difference. First operand 179 states and 203 transitions. Second operand has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-14 04:49:46,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:49,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:51,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:53,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:55,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:57,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:49:59,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:02,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:04,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:06,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:08,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:10,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:12,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:14,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:16,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:50:16,555 INFO L93 Difference]: Finished difference Result 218 states and 248 transitions. [2024-11-14 04:50:16,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:50:16,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 83 [2024-11-14 04:50:16,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:50:16,562 INFO L225 Difference]: With dead ends: 218 [2024-11-14 04:50:16,562 INFO L226 Difference]: Without dead ends: 216 [2024-11-14 04:50:16,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:50:16,563 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 39 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:50:16,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 302 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 14 Unknown, 0 Unchecked, 31.9s Time] [2024-11-14 04:50:16,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-14 04:50:16,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-11-14 04:50:16,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 200 states have (on average 1.11) internal successors, (222), 202 states have internal predecessors, (222), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-14 04:50:16,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 246 transitions. [2024-11-14 04:50:16,578 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 246 transitions. Word has length 83 [2024-11-14 04:50:16,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:50:16,579 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 246 transitions. [2024-11-14 04:50:16,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-14 04:50:16,579 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 246 transitions. [2024-11-14 04:50:16,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-14 04:50:16,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:50:16,581 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:50:16,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 04:50:16,582 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-14 04:50:16,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:50:16,582 INFO L85 PathProgramCache]: Analyzing trace with hash 560576619, now seen corresponding path program 1 times [2024-11-14 04:50:16,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:50:16,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095116925] [2024-11-14 04:50:16,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:50:16,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:50:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:50:19,447 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 04:50:19,449 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:50:19,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095116925] [2024-11-14 04:50:19,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095116925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:50:19,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919642026] [2024-11-14 04:50:19,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:50:19,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:50:19,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:50:19,453 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:50:19,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 04:50:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:50:24,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-14 04:50:24,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:50:24,725 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 04:50:24,725 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:50:24,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919642026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:50:24,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:50:24,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 6 [2024-11-14 04:50:24,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118500527] [2024-11-14 04:50:24,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:50:24,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:50:24,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:50:24,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:50:24,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:50:24,729 INFO L87 Difference]: Start difference. First operand 216 states and 246 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 04:50:26,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:28,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:31,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:33,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:35,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:38,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:39,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:41,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:43,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:45,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:49,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:51,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:53,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:55,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:56,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:50:58,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-14 04:51:00,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:51:00,851 INFO L93 Difference]: Finished difference Result 412 states and 482 transitions. [2024-11-14 04:51:00,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:51:00,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 87 [2024-11-14 04:51:00,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:51:00,855 INFO L225 Difference]: With dead ends: 412 [2024-11-14 04:51:00,855 INFO L226 Difference]: Without dead ends: 218 [2024-11-14 04:51:00,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:51:00,858 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 101 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:51:00,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 394 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 13 Unknown, 0 Unchecked, 36.1s Time] [2024-11-14 04:51:00,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-14 04:51:00,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-11-14 04:51:00,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 201 states have (on average 1.1144278606965174) internal successors, (224), 204 states have internal predecessors, (224), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-14 04:51:00,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 252 transitions. [2024-11-14 04:51:00,884 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 252 transitions. Word has length 87 [2024-11-14 04:51:00,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:51:00,884 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 252 transitions. [2024-11-14 04:51:00,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 04:51:00,885 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 252 transitions. [2024-11-14 04:51:00,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-14 04:51:00,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:51:00,887 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:51:00,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 04:51:01,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:51:01,088 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-14 04:51:01,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:51:01,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1569313513, now seen corresponding path program 1 times [2024-11-14 04:51:01,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:51:01,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897008588] [2024-11-14 04:51:01,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:51:01,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:51:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:51:03,429 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 04:51:03,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:51:03,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897008588] [2024-11-14 04:51:03,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897008588] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:51:03,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970627057] [2024-11-14 04:51:03,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:51:03,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:51:03,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:51:03,435 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:51:03,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_effbe362-2f5e-4cd6-b6f9-10c3e9279541/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 04:51:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:51:13,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 04:51:13,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:51:13,921 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 04:51:13,922 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:51:14,406 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 04:51:14,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970627057] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:51:14,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2055909891] [2024-11-14 04:51:14,432 INFO L159 IcfgInterpreter]: Started Sifa with 76 locations of interest [2024-11-14 04:51:14,432 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:51:14,436 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:51:14,440 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:51:14,441 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:52:29,972 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 145 for LOIs [2024-11-14 04:52:30,114 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:52:56,188 WARN L286 SmtUtils]: Spent 5.44s on a formula simplification that was a NOOP. DAG size: 180 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:53:04,805 WARN L286 SmtUtils]: Spent 7.08s on a formula simplification that was a NOOP. DAG size: 185 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:53:06,823 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~user~0#1.offset| 0) (let ((.cse23 (exists ((|v_#Ultimate.C_memset_#t~loopctr310_34| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr310_34|) (<= 384 (mod |v_#Ultimate.C_memset_#t~loopctr310_34| 4294967296)))))) (or (and (exists ((|v_#memory_int_703| (Array Int (Array Int Int))) (|v_#valid_84| (Array Int Int)) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| (Array Int (Array Int Int))) (|v_#length_52| (Array Int Int)) (|v_#memory_$Pointer$.base_185| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_580| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_184| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_183| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_43| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_183| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_580| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_184| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_185| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc57#1.base_6| Int) (|v_#memory_int_200| (Array Int (Array Int Int))) (|v_#memory_int_201| (Array Int (Array Int Int)))) (let ((.cse15 (select (select |v_#memory_$Pointer$.base_184| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse16 (select (select |v_#memory_$Pointer$.offset_184| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse19 (select (select |v_#memory_$Pointer$.base_580| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse20 (+ (select (select |v_#memory_$Pointer$.offset_580| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 16))) (let ((.cse0 (store |v_#memory_$Pointer$.offset_580| .cse19 (store (select |v_#memory_$Pointer$.offset_580| .cse19) .cse20 8))) (.cse11 (store |v_#memory_$Pointer$.base_580| .cse19 (store (select |v_#memory_$Pointer$.base_580| .cse19) .cse20 |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse5 (store |v_#memory_$Pointer$.offset_184| .cse15 (store (select |v_#memory_$Pointer$.offset_184| .cse15) .cse16 0))) (.cse8 (store |v_#memory_$Pointer$.base_184| .cse15 (store (select |v_#memory_$Pointer$.base_184| .cse15) .cse16 |v_ULTIMATE.start_main_#t~malloc57#1.base_6|))) (.cse21 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse22 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (let ((.cse3 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| .cse21) .cse22)) (.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse7 (+ 40 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (.cse4 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| .cse21) .cse22)) (.cse9 (select (select |v_#memory_$Pointer$.base_183| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse10 (+ (select (select |v_#memory_$Pointer$.offset_183| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 8)) (.cse1 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4)) (.cse12 (select (select |v_#memory_$Pointer$.base_185| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse13 (+ (select (select |v_#memory_$Pointer$.offset_185| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 20))) (and (= (select |v_#valid_84| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0) (= (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 (select (select |v_#memory_$Pointer$.offset_183| .cse1) .cse2))) |v_#memory_$Pointer$.offset_183|) (or (not (= .cse3 0)) (not (= .cse4 0))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| .cse6) .cse7)))) (= .cse3 |c_ULTIMATE.start_main_#t~mem63#1.base|) (= |c_#valid| (store |v_#valid_84| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1)) (not (= |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 0)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| .cse6) .cse7)))) (= (store |v_#memory_$Pointer$.offset_183| .cse9 (store (select |v_#memory_$Pointer$.offset_183| .cse9) .cse10 (select (select |v_#memory_$Pointer$.offset_185| .cse9) .cse10))) |v_#memory_$Pointer$.offset_185|) (= (store .cse11 .cse1 (store (select .cse11 .cse1) .cse2 (select (select |v_#memory_$Pointer$.base_183| .cse1) .cse2))) |v_#memory_$Pointer$.base_183|) (= |c_ULTIMATE.start_main_#t~mem63#1.offset| .cse4) (= (store |v_#memory_$Pointer$.base_185| .cse12 (store (select |v_#memory_$Pointer$.base_185| .cse12) .cse13 (select (select |v_#memory_$Pointer$.base_184| .cse12) .cse13))) |v_#memory_$Pointer$.base_184|) (= |v_#memory_$Pointer$.base_185| (store |v_#memory_$Pointer$.base_183| .cse9 (store (select |v_#memory_$Pointer$.base_183| .cse9) .cse10 (select (select |v_#memory_$Pointer$.base_185| .cse9) .cse10)))) (= (let ((.cse14 (let ((.cse17 (let ((.cse18 (store |v_#memory_int_201| .cse1 (store (select |v_#memory_int_201| .cse1) .cse2 32)))) (store .cse18 .cse9 (store (select .cse18 .cse9) .cse10 5))))) (store .cse17 .cse12 (store (select .cse17 .cse12) .cse13 8))))) (store .cse14 .cse15 (store (select .cse14 .cse15) .cse16 (select (select |v_#memory_int_200| .cse15) .cse16)))) |v_#memory_int_200|) (= |v_#memory_$Pointer$.offset_184| (store |v_#memory_$Pointer$.offset_185| .cse12 (store (select |v_#memory_$Pointer$.offset_185| .cse12) .cse13 (select (select |v_#memory_$Pointer$.offset_184| .cse12) .cse13)))) (= (store |v_#memory_int_703| .cse19 (store (select |v_#memory_int_703| .cse19) .cse20 (select (select |v_#memory_int_201| .cse19) .cse20))) |v_#memory_int_201|) (<= (+ |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_52| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 384))))))) .cse23) (and .cse23 (exists ((|v_#memory_int_703| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_44| (Array Int (Array Int Int))) (|v_#valid_84| (Array Int Int)) (|v_#length_52| (Array Int Int)) (|v_#memory_$Pointer$.base_185| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_580| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_184| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_183| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_BEFORE_CALL_72| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_183| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_580| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_184| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_185| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc57#1.base_6| Int) (|v_#memory_int_200| (Array Int (Array Int Int))) (|v_#memory_int_201| (Array Int (Array Int Int)))) (let ((.cse42 (select (select |v_#memory_$Pointer$.base_580| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse43 (+ (select (select |v_#memory_$Pointer$.offset_580| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 16)) (.cse36 (select (select |v_#memory_$Pointer$.base_184| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse37 (select (select |v_#memory_$Pointer$.offset_184| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (let ((.cse27 (store |v_#memory_$Pointer$.offset_184| .cse36 (store (select |v_#memory_$Pointer$.offset_184| .cse36) .cse37 0))) (.cse44 (store |v_#memory_$Pointer$.base_184| .cse36 (store (select |v_#memory_$Pointer$.base_184| .cse36) .cse37 |v_ULTIMATE.start_main_#t~malloc57#1.base_6|))) (.cse45 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_72| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse46 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_44| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse24 (store |v_#memory_$Pointer$.offset_580| .cse42 (store (select |v_#memory_$Pointer$.offset_580| .cse42) .cse43 8))) (.cse32 (store |v_#memory_$Pointer$.base_580| .cse42 (store (select |v_#memory_$Pointer$.base_580| .cse42) .cse43 |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse30 (select (select |v_#memory_$Pointer$.base_183| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse31 (+ (select (select |v_#memory_$Pointer$.offset_183| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 8)) (.cse25 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse26 (+ (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4)) (.cse41 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_72| .cse45) .cse46)) (.cse33 (select (select |v_#memory_$Pointer$.base_185| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse34 (+ (select (select |v_#memory_$Pointer$.offset_185| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 20)) (.cse40 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_44| .cse45) .cse46)) (.cse28 (select (select .cse44 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse29 (+ 40 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) 8)))) (and (= (select |v_#valid_84| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0) (= (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 (select (select |v_#memory_$Pointer$.offset_183| .cse25) .cse26))) |v_#memory_$Pointer$.offset_183|) (= (store .cse27 .cse28 (store (select .cse27 .cse28) .cse29 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_44| .cse28) .cse29))) |v_old(#memory_$Pointer$.offset)_AFTER_CALL_44|) (= |c_#valid| (store |v_#valid_84| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1)) (not (= |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 0)) (= (store |v_#memory_$Pointer$.offset_183| .cse30 (store (select |v_#memory_$Pointer$.offset_183| .cse30) .cse31 (select (select |v_#memory_$Pointer$.offset_185| .cse30) .cse31))) |v_#memory_$Pointer$.offset_185|) (= (store .cse32 .cse25 (store (select .cse32 .cse25) .cse26 (select (select |v_#memory_$Pointer$.base_183| .cse25) .cse26))) |v_#memory_$Pointer$.base_183|) (= (store |v_#memory_$Pointer$.base_185| .cse33 (store (select |v_#memory_$Pointer$.base_185| .cse33) .cse34 (select (select |v_#memory_$Pointer$.base_184| .cse33) .cse34))) |v_#memory_$Pointer$.base_184|) (= |v_#memory_$Pointer$.base_185| (store |v_#memory_$Pointer$.base_183| .cse30 (store (select |v_#memory_$Pointer$.base_183| .cse30) .cse31 (select (select |v_#memory_$Pointer$.base_185| .cse30) .cse31)))) (= (let ((.cse35 (let ((.cse38 (let ((.cse39 (store |v_#memory_int_201| .cse25 (store (select |v_#memory_int_201| .cse25) .cse26 32)))) (store .cse39 .cse30 (store (select .cse39 .cse30) .cse31 5))))) (store .cse38 .cse33 (store (select .cse38 .cse33) .cse34 8))))) (store .cse35 .cse36 (store (select .cse35 .cse36) .cse37 (select (select |v_#memory_int_200| .cse36) .cse37)))) |v_#memory_int_200|) (or (not (= .cse40 0)) (not (= .cse41 0))) (= |c_ULTIMATE.start_main_#t~mem63#1.base| .cse41) (= |v_#memory_$Pointer$.offset_184| (store |v_#memory_$Pointer$.offset_185| .cse33 (store (select |v_#memory_$Pointer$.offset_185| .cse33) .cse34 (select (select |v_#memory_$Pointer$.offset_184| .cse33) .cse34)))) (= |c_ULTIMATE.start_main_#t~mem63#1.offset| .cse40) (= (store |v_#memory_int_703| .cse42 (store (select |v_#memory_int_703| .cse42) .cse43 (select (select |v_#memory_int_201| .cse42) .cse43))) |v_#memory_int_201|) (<= (+ |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1) |c_#StackHeapBarrier|) (= (store .cse44 .cse28 (store (select .cse44 .cse28) .cse29 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_72| .cse28) .cse29))) |v_#memory_$Pointer$.base_BEFORE_CALL_72|) (= |c_#length| (store |v_#length_52| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 384)))))))))) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~altusers~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~0#1| 2147483647) (<= 0 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2024-11-14 04:54:13,072 WARN L286 SmtUtils]: Spent 23.68s on a formula simplification that was a NOOP. DAG size: 212 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:54:15,088 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~user~0#1.offset| 0) (= |c_ULTIMATE.start_main_~users~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~altusers~0#1.offset| 0) (let ((.cse0 (exists ((|v_#Ultimate.C_memset_#t~loopctr310_34| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr310_34|) (<= 384 (mod |v_#Ultimate.C_memset_#t~loopctr310_34| 4294967296)))))) (or (and .cse0 (exists ((|v_#memory_int_703| (Array Int (Array Int Int))) (|v_#valid_84| (Array Int Int)) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| (Array Int (Array Int Int))) (|v_#length_52| (Array Int Int)) (|v_#memory_$Pointer$.base_185| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_580| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_184| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_183| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_43| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_183| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_580| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_184| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_185| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc57#1.base_6| Int) (|v_#memory_int_200| (Array Int (Array Int Int))) (|v_#memory_int_201| (Array Int (Array Int Int)))) (let ((.cse16 (select (select |v_#memory_$Pointer$.base_184| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse17 (select (select |v_#memory_$Pointer$.offset_184| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse20 (select (select |v_#memory_$Pointer$.base_580| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse21 (+ (select (select |v_#memory_$Pointer$.offset_580| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 16))) (let ((.cse1 (store |v_#memory_$Pointer$.offset_580| .cse20 (store (select |v_#memory_$Pointer$.offset_580| .cse20) .cse21 8))) (.cse12 (store |v_#memory_$Pointer$.base_580| .cse20 (store (select |v_#memory_$Pointer$.base_580| .cse20) .cse21 |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse6 (store |v_#memory_$Pointer$.offset_184| .cse16 (store (select |v_#memory_$Pointer$.offset_184| .cse16) .cse17 0))) (.cse9 (store |v_#memory_$Pointer$.base_184| .cse16 (store (select |v_#memory_$Pointer$.base_184| .cse16) .cse17 |v_ULTIMATE.start_main_#t~malloc57#1.base_6|)))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse8 (+ 40 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (.cse10 (select (select |v_#memory_$Pointer$.base_183| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse11 (+ (select (select |v_#memory_$Pointer$.offset_183| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 8)) (.cse2 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse3 (+ (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4)) (.cse13 (select (select |v_#memory_$Pointer$.base_185| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse14 (+ (select (select |v_#memory_$Pointer$.offset_185| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 20))) (and (= (select |v_#valid_84| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0) (= (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 (select (select |v_#memory_$Pointer$.offset_183| .cse2) .cse3))) |v_#memory_$Pointer$.offset_183|) (let ((.cse4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse5 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (or (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| .cse4) .cse5) 0)) (not (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| .cse4) .cse5) 0)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| .cse7) .cse8)))) (= |c_#valid| (store |v_#valid_84| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1)) (not (= |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 0)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| .cse7) .cse8)))) (= (store |v_#memory_$Pointer$.offset_183| .cse10 (store (select |v_#memory_$Pointer$.offset_183| .cse10) .cse11 (select (select |v_#memory_$Pointer$.offset_185| .cse10) .cse11))) |v_#memory_$Pointer$.offset_185|) (= (store .cse12 .cse2 (store (select .cse12 .cse2) .cse3 (select (select |v_#memory_$Pointer$.base_183| .cse2) .cse3))) |v_#memory_$Pointer$.base_183|) (= (store |v_#memory_$Pointer$.base_185| .cse13 (store (select |v_#memory_$Pointer$.base_185| .cse13) .cse14 (select (select |v_#memory_$Pointer$.base_184| .cse13) .cse14))) |v_#memory_$Pointer$.base_184|) (= |v_#memory_$Pointer$.base_185| (store |v_#memory_$Pointer$.base_183| .cse10 (store (select |v_#memory_$Pointer$.base_183| .cse10) .cse11 (select (select |v_#memory_$Pointer$.base_185| .cse10) .cse11)))) (= (let ((.cse15 (let ((.cse18 (let ((.cse19 (store |v_#memory_int_201| .cse2 (store (select |v_#memory_int_201| .cse2) .cse3 32)))) (store .cse19 .cse10 (store (select .cse19 .cse10) .cse11 5))))) (store .cse18 .cse13 (store (select .cse18 .cse13) .cse14 8))))) (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 (select (select |v_#memory_int_200| .cse16) .cse17)))) |v_#memory_int_200|) (= |v_#memory_$Pointer$.offset_184| (store |v_#memory_$Pointer$.offset_185| .cse13 (store (select |v_#memory_$Pointer$.offset_185| .cse13) .cse14 (select (select |v_#memory_$Pointer$.offset_184| .cse13) .cse14)))) (= (store |v_#memory_int_703| .cse20 (store (select |v_#memory_int_703| .cse20) .cse21 (select (select |v_#memory_int_201| .cse20) .cse21))) |v_#memory_int_201|) (<= (+ |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_52| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 384)))))))) (and (exists ((|v_#memory_int_703| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_44| (Array Int (Array Int Int))) (|v_#valid_84| (Array Int Int)) (|v_#length_52| (Array Int Int)) (|v_#memory_$Pointer$.base_185| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_580| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_184| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_183| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_BEFORE_CALL_72| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_183| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_580| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_184| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_185| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc57#1.base_6| Int) (|v_#memory_int_200| (Array Int (Array Int Int))) (|v_#memory_int_201| (Array Int (Array Int Int)))) (let ((.cse40 (select (select |v_#memory_$Pointer$.base_580| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse41 (+ (select (select |v_#memory_$Pointer$.offset_580| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 16)) (.cse34 (select (select |v_#memory_$Pointer$.base_184| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse35 (select (select |v_#memory_$Pointer$.offset_184| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (let ((.cse25 (store |v_#memory_$Pointer$.offset_184| .cse34 (store (select |v_#memory_$Pointer$.offset_184| .cse34) .cse35 0))) (.cse42 (store |v_#memory_$Pointer$.base_184| .cse34 (store (select |v_#memory_$Pointer$.base_184| .cse34) .cse35 |v_ULTIMATE.start_main_#t~malloc57#1.base_6|))) (.cse22 (store |v_#memory_$Pointer$.offset_580| .cse40 (store (select |v_#memory_$Pointer$.offset_580| .cse40) .cse41 8))) (.cse30 (store |v_#memory_$Pointer$.base_580| .cse40 (store (select |v_#memory_$Pointer$.base_580| .cse40) .cse41 |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse28 (select (select |v_#memory_$Pointer$.base_183| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse29 (+ (select (select |v_#memory_$Pointer$.offset_183| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 8)) (.cse23 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse24 (+ (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4)) (.cse31 (select (select |v_#memory_$Pointer$.base_185| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse32 (+ (select (select |v_#memory_$Pointer$.offset_185| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 20)) (.cse26 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse27 (+ 40 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) 8)))) (and (= (select |v_#valid_84| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0) (= (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 (select (select |v_#memory_$Pointer$.offset_183| .cse23) .cse24))) |v_#memory_$Pointer$.offset_183|) (= (store .cse25 .cse26 (store (select .cse25 .cse26) .cse27 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_44| .cse26) .cse27))) |v_old(#memory_$Pointer$.offset)_AFTER_CALL_44|) (= |c_#valid| (store |v_#valid_84| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1)) (not (= |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 0)) (= (store |v_#memory_$Pointer$.offset_183| .cse28 (store (select |v_#memory_$Pointer$.offset_183| .cse28) .cse29 (select (select |v_#memory_$Pointer$.offset_185| .cse28) .cse29))) |v_#memory_$Pointer$.offset_185|) (= (store .cse30 .cse23 (store (select .cse30 .cse23) .cse24 (select (select |v_#memory_$Pointer$.base_183| .cse23) .cse24))) |v_#memory_$Pointer$.base_183|) (= (store |v_#memory_$Pointer$.base_185| .cse31 (store (select |v_#memory_$Pointer$.base_185| .cse31) .cse32 (select (select |v_#memory_$Pointer$.base_184| .cse31) .cse32))) |v_#memory_$Pointer$.base_184|) (= |v_#memory_$Pointer$.base_185| (store |v_#memory_$Pointer$.base_183| .cse28 (store (select |v_#memory_$Pointer$.base_183| .cse28) .cse29 (select (select |v_#memory_$Pointer$.base_185| .cse28) .cse29)))) (= (let ((.cse33 (let ((.cse36 (let ((.cse37 (store |v_#memory_int_201| .cse23 (store (select |v_#memory_int_201| .cse23) .cse24 32)))) (store .cse37 .cse28 (store (select .cse37 .cse28) .cse29 5))))) (store .cse36 .cse31 (store (select .cse36 .cse31) .cse32 8))))) (store .cse33 .cse34 (store (select .cse33 .cse34) .cse35 (select (select |v_#memory_int_200| .cse34) .cse35)))) |v_#memory_int_200|) (let ((.cse38 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_72| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse39 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_44| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (or (not (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_44| .cse38) .cse39) 0)) (not (= (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_72| .cse38) .cse39) 0)))) (= |v_#memory_$Pointer$.offset_184| (store |v_#memory_$Pointer$.offset_185| .cse31 (store (select |v_#memory_$Pointer$.offset_185| .cse31) .cse32 (select (select |v_#memory_$Pointer$.offset_184| .cse31) .cse32)))) (= (store |v_#memory_int_703| .cse40 (store (select |v_#memory_int_703| .cse40) .cse41 (select (select |v_#memory_int_201| .cse40) .cse41))) |v_#memory_int_201|) (<= (+ |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1) |c_#StackHeapBarrier|) (= (store .cse42 .cse26 (store (select .cse42 .cse26) .cse27 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_72| .cse26) .cse27))) |v_#memory_$Pointer$.base_BEFORE_CALL_72|) (= |c_#length| (store |v_#length_52| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 384))))))) .cse0))) (<= |c_ULTIMATE.start_main_~i~0#1| 2147483647) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~users~0#1.base| |c_ULTIMATE.start_main_~user~0#1.base|)) is different from false [2024-11-14 04:56:11,224 WARN L286 SmtUtils]: Spent 1.01m on a formula simplification that was a NOOP. DAG size: 248 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:56:13,242 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~user~0#1.offset| 0) (= |c_ULTIMATE.start_main_~users~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.base_581| (Array Int (Array Int Int))) (|v_#memory_int_704| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_581| (Array Int (Array Int Int)))) (let ((.cse0 (select (select |v_#memory_$Pointer$.base_581| |c_ULTIMATE.start_main_~users~0#1.base|) 8)) (.cse1 (+ (select (select |v_#memory_$Pointer$.offset_581| |c_ULTIMATE.start_main_~users~0#1.base|) 8) 12))) (and (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_581| .cse0 (store (select |v_#memory_$Pointer$.base_581| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)))) (= (store |v_#memory_int_704| .cse0 (let ((.cse2 (select |v_#memory_int_704| .cse0))) (store .cse2 .cse1 (+ (select .cse2 .cse1) 1)))) |c_#memory_int|) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_581| .cse0 (store (select |v_#memory_$Pointer$.offset_581| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))))))) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~altusers~0#1.offset| 0) (let ((.cse3 (exists ((|v_#Ultimate.C_memset_#t~loopctr310_34| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr310_34|) (<= 384 (mod |v_#Ultimate.C_memset_#t~loopctr310_34| 4294967296)))))) (or (and .cse3 (exists ((|v_#memory_int_703| (Array Int (Array Int Int))) (|v_#valid_84| (Array Int Int)) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| (Array Int (Array Int Int))) (|v_#length_52| (Array Int Int)) (|v_#memory_$Pointer$.base_185| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_580| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_184| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_183| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_43| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_183| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_580| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_184| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_185| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc57#1.base_6| Int) (|v_#memory_int_200| (Array Int (Array Int Int))) (|v_#memory_int_201| (Array Int (Array Int Int)))) (let ((.cse19 (select (select |v_#memory_$Pointer$.base_184| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse20 (select (select |v_#memory_$Pointer$.offset_184| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse23 (select (select |v_#memory_$Pointer$.base_580| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse24 (+ (select (select |v_#memory_$Pointer$.offset_580| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 16))) (let ((.cse4 (store |v_#memory_$Pointer$.offset_580| .cse23 (store (select |v_#memory_$Pointer$.offset_580| .cse23) .cse24 8))) (.cse15 (store |v_#memory_$Pointer$.base_580| .cse23 (store (select |v_#memory_$Pointer$.base_580| .cse23) .cse24 |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse9 (store |v_#memory_$Pointer$.offset_184| .cse19 (store (select |v_#memory_$Pointer$.offset_184| .cse19) .cse20 0))) (.cse12 (store |v_#memory_$Pointer$.base_184| .cse19 (store (select |v_#memory_$Pointer$.base_184| .cse19) .cse20 |v_ULTIMATE.start_main_#t~malloc57#1.base_6|)))) (let ((.cse10 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse11 (+ 40 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (.cse13 (select (select |v_#memory_$Pointer$.base_183| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse14 (+ (select (select |v_#memory_$Pointer$.offset_183| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 8)) (.cse5 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse6 (+ (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4)) (.cse16 (select (select |v_#memory_$Pointer$.base_185| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse17 (+ (select (select |v_#memory_$Pointer$.offset_185| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 20))) (and (= (select |v_#valid_84| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0) (= (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 (select (select |v_#memory_$Pointer$.offset_183| .cse5) .cse6))) |v_#memory_$Pointer$.offset_183|) (let ((.cse7 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse8 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (or (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| .cse7) .cse8) 0)) (not (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| .cse7) .cse8) 0)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| .cse10) .cse11)))) (= |c_#valid| (store |v_#valid_84| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1)) (not (= |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 0)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| (store .cse12 .cse10 (store (select .cse12 .cse10) .cse11 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| .cse10) .cse11)))) (= (store |v_#memory_$Pointer$.offset_183| .cse13 (store (select |v_#memory_$Pointer$.offset_183| .cse13) .cse14 (select (select |v_#memory_$Pointer$.offset_185| .cse13) .cse14))) |v_#memory_$Pointer$.offset_185|) (= (store .cse15 .cse5 (store (select .cse15 .cse5) .cse6 (select (select |v_#memory_$Pointer$.base_183| .cse5) .cse6))) |v_#memory_$Pointer$.base_183|) (= (store |v_#memory_$Pointer$.base_185| .cse16 (store (select |v_#memory_$Pointer$.base_185| .cse16) .cse17 (select (select |v_#memory_$Pointer$.base_184| .cse16) .cse17))) |v_#memory_$Pointer$.base_184|) (= |v_#memory_$Pointer$.base_185| (store |v_#memory_$Pointer$.base_183| .cse13 (store (select |v_#memory_$Pointer$.base_183| .cse13) .cse14 (select (select |v_#memory_$Pointer$.base_185| .cse13) .cse14)))) (= (let ((.cse18 (let ((.cse21 (let ((.cse22 (store |v_#memory_int_201| .cse5 (store (select |v_#memory_int_201| .cse5) .cse6 32)))) (store .cse22 .cse13 (store (select .cse22 .cse13) .cse14 5))))) (store .cse21 .cse16 (store (select .cse21 .cse16) .cse17 8))))) (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 (select (select |v_#memory_int_200| .cse19) .cse20)))) |v_#memory_int_200|) (= |v_#memory_$Pointer$.offset_184| (store |v_#memory_$Pointer$.offset_185| .cse16 (store (select |v_#memory_$Pointer$.offset_185| .cse16) .cse17 (select (select |v_#memory_$Pointer$.offset_184| .cse16) .cse17)))) (= (store |v_#memory_int_703| .cse23 (store (select |v_#memory_int_703| .cse23) .cse24 (select (select |v_#memory_int_201| .cse23) .cse24))) |v_#memory_int_201|) (<= (+ |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_52| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 384)))))))) (and (exists ((|v_#memory_int_703| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_44| (Array Int (Array Int Int))) (|v_#valid_84| (Array Int Int)) (|v_#length_52| (Array Int Int)) (|v_#memory_$Pointer$.base_185| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_580| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_184| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_183| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_BEFORE_CALL_72| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_183| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_580| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_184| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_185| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc57#1.base_6| Int) (|v_#memory_int_200| (Array Int (Array Int Int))) (|v_#memory_int_201| (Array Int (Array Int Int)))) (let ((.cse43 (select (select |v_#memory_$Pointer$.base_580| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse44 (+ (select (select |v_#memory_$Pointer$.offset_580| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 16)) (.cse37 (select (select |v_#memory_$Pointer$.base_184| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse38 (select (select |v_#memory_$Pointer$.offset_184| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (let ((.cse28 (store |v_#memory_$Pointer$.offset_184| .cse37 (store (select |v_#memory_$Pointer$.offset_184| .cse37) .cse38 0))) (.cse45 (store |v_#memory_$Pointer$.base_184| .cse37 (store (select |v_#memory_$Pointer$.base_184| .cse37) .cse38 |v_ULTIMATE.start_main_#t~malloc57#1.base_6|))) (.cse25 (store |v_#memory_$Pointer$.offset_580| .cse43 (store (select |v_#memory_$Pointer$.offset_580| .cse43) .cse44 8))) (.cse33 (store |v_#memory_$Pointer$.base_580| .cse43 (store (select |v_#memory_$Pointer$.base_580| .cse43) .cse44 |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse31 (select (select |v_#memory_$Pointer$.base_183| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse32 (+ (select (select |v_#memory_$Pointer$.offset_183| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 8)) (.cse26 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse27 (+ (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4)) (.cse34 (select (select |v_#memory_$Pointer$.base_185| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse35 (+ (select (select |v_#memory_$Pointer$.offset_185| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 20)) (.cse29 (select (select .cse45 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse30 (+ 40 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) 8)))) (and (= (select |v_#valid_84| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0) (= (store .cse25 .cse26 (store (select .cse25 .cse26) .cse27 (select (select |v_#memory_$Pointer$.offset_183| .cse26) .cse27))) |v_#memory_$Pointer$.offset_183|) (= (store .cse28 .cse29 (store (select .cse28 .cse29) .cse30 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_44| .cse29) .cse30))) |v_old(#memory_$Pointer$.offset)_AFTER_CALL_44|) (= |c_#valid| (store |v_#valid_84| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1)) (not (= |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 0)) (= (store |v_#memory_$Pointer$.offset_183| .cse31 (store (select |v_#memory_$Pointer$.offset_183| .cse31) .cse32 (select (select |v_#memory_$Pointer$.offset_185| .cse31) .cse32))) |v_#memory_$Pointer$.offset_185|) (= (store .cse33 .cse26 (store (select .cse33 .cse26) .cse27 (select (select |v_#memory_$Pointer$.base_183| .cse26) .cse27))) |v_#memory_$Pointer$.base_183|) (= (store |v_#memory_$Pointer$.base_185| .cse34 (store (select |v_#memory_$Pointer$.base_185| .cse34) .cse35 (select (select |v_#memory_$Pointer$.base_184| .cse34) .cse35))) |v_#memory_$Pointer$.base_184|) (= |v_#memory_$Pointer$.base_185| (store |v_#memory_$Pointer$.base_183| .cse31 (store (select |v_#memory_$Pointer$.base_183| .cse31) .cse32 (select (select |v_#memory_$Pointer$.base_185| .cse31) .cse32)))) (= (let ((.cse36 (let ((.cse39 (let ((.cse40 (store |v_#memory_int_201| .cse26 (store (select |v_#memory_int_201| .cse26) .cse27 32)))) (store .cse40 .cse31 (store (select .cse40 .cse31) .cse32 5))))) (store .cse39 .cse34 (store (select .cse39 .cse34) .cse35 8))))) (store .cse36 .cse37 (store (select .cse36 .cse37) .cse38 (select (select |v_#memory_int_200| .cse37) .cse38)))) |v_#memory_int_200|) (let ((.cse41 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_72| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse42 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_44| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (or (not (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_44| .cse41) .cse42) 0)) (not (= (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_72| .cse41) .cse42) 0)))) (= |v_#memory_$Pointer$.offset_184| (store |v_#memory_$Pointer$.offset_185| .cse34 (store (select |v_#memory_$Pointer$.offset_185| .cse34) .cse35 (select (select |v_#memory_$Pointer$.offset_184| .cse34) .cse35)))) (= (store |v_#memory_int_703| .cse43 (store (select |v_#memory_int_703| .cse43) .cse44 (select (select |v_#memory_int_201| .cse43) .cse44))) |v_#memory_int_201|) (<= (+ |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1) |c_#StackHeapBarrier|) (= (store .cse45 .cse29 (store (select .cse45 .cse29) .cse30 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_72| .cse29) .cse30))) |v_#memory_$Pointer$.base_BEFORE_CALL_72|) (= |c_#length| (store |v_#length_52| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 384))))))) .cse3))) (<= |c_ULTIMATE.start_main_~i~0#1| 2147483647) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~users~0#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) (let ((.cse50 (mod (+ (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~users~0#1.base|) 8)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~users~0#1.base|) 8) 4)) 4294967295) 4294967296)) (.cse51 (mod |c_ULTIMATE.start_main_~_ha_hashv~0#1| 4294967296))) (let ((.cse46 (= .cse51 0)) (.cse47 (= .cse50 0))) (or (and (= |c_ULTIMATE.start_main_~_ha_bkt~0#1| 0) (or .cse46 .cse47)) (and (not .cse46) (let ((.cse48 (= .cse50 .cse51))) (or (and (= |c_ULTIMATE.start_main_~_ha_bkt~0#1| |c_ULTIMATE.start_main_~_ha_hashv~0#1|) .cse48) (let ((.cse49 (mod |c_ULTIMATE.start_main_~_ha_bkt~0#1| 4294967296))) (and (not .cse48) (<= .cse49 .cse50) (<= .cse49 .cse51))))) (not .cse47)))))) is different from false [2024-11-14 05:01:26,925 WARN L286 SmtUtils]: Spent 3.65m on a formula simplification that was a NOOP. DAG size: 309 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)