./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje --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 765142a1ef820c0c2cf2fa98a3978a1412f5a1196c629c20848264001100dcc9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:04:01,213 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:04:01,365 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Overflow-32bit-Taipan_Default.epf [2024-11-09 05:04:01,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:04:01,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:04:01,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:04:01,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:04:01,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:04:01,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:04:01,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:04:01,423 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:04:01,423 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:04:01,424 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:04:01,424 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:04:01,425 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:04:01,427 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:04:01,428 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:04:01,428 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:04:01,428 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:04:01,429 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:04:01,429 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:04:01,434 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:04:01,435 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:04:01,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 05:04:01,435 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:04:01,435 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:04:01,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:04:01,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:04:01,436 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 05:04:01,436 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:04:01,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 05:04:01,437 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:04:01,437 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 05:04:01,439 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:04:01,440 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:04:01,440 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 05:04:01,440 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:04:01,441 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:04:01,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:04:01,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:04:01,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:04:01,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:04:01,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:04:01,443 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 05:04:01,444 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:04:01,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:04:01,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:04:01,445 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:04:01,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:04:01,445 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje 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 -> 765142a1ef820c0c2cf2fa98a3978a1412f5a1196c629c20848264001100dcc9 [2024-11-09 05:04:01,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:04:01,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:04:01,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:04:01,861 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:04:01,862 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:04:01,863 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i Unable to find full path for "g++" [2024-11-09 05:04:03,935 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:04:04,326 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:04:04,326 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i [2024-11-09 05:04:04,350 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/data/f4417ed9f/bbbe2fdcdfc046a8940f50c9058e207d/FLAG0fa24b136 [2024-11-09 05:04:04,372 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/data/f4417ed9f/bbbe2fdcdfc046a8940f50c9058e207d [2024-11-09 05:04:04,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:04:04,383 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:04:04,384 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:04:04,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:04:04,393 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:04:04,394 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:04:04" (1/1) ... [2024-11-09 05:04:04,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f83d5c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:04, skipping insertion in model container [2024-11-09 05:04:04,400 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:04:04" (1/1) ... [2024-11-09 05:04:04,493 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:04:05,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:04:05,299 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:04:05,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:04:05,510 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:04:05,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:05 WrapperNode [2024-11-09 05:04:05,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:04:05,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:04:05,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:04:05,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:04:05,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:05" (1/1) ... [2024-11-09 05:04:05,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:05" (1/1) ... [2024-11-09 05:04:05,662 INFO L138 Inliner]: procedures = 176, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1563 [2024-11-09 05:04:05,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:04:05,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:04:05,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:04:05,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:04:05,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:05" (1/1) ... [2024-11-09 05:04:05,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:05" (1/1) ... [2024-11-09 05:04:05,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:05" (1/1) ... [2024-11-09 05:04:05,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:05" (1/1) ... [2024-11-09 05:04:05,787 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:05" (1/1) ... [2024-11-09 05:04:05,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:05" (1/1) ... [2024-11-09 05:04:05,816 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:05" (1/1) ... [2024-11-09 05:04:05,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:05" (1/1) ... [2024-11-09 05:04:05,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:04:05,844 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:04:05,844 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:04:05,844 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:04:05,845 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:05" (1/1) ... [2024-11-09 05:04:05,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:04:05,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:04:05,927 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:04:05,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:04:05,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:04:05,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 05:04:05,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 05:04:05,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:04:05,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-09 05:04:05,976 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-09 05:04:05,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 05:04:05,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:04:05,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 05:04:05,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 05:04:05,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:04:05,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:04:05,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:04:05,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:04:06,333 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:04:06,336 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:04:08,483 INFO L? ?]: Removed 397 outVars from TransFormulas that were not future-live. [2024-11-09 05:04:08,483 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:04:10,302 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:04:10,302 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-09 05:04:10,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:04:10 BoogieIcfgContainer [2024-11-09 05:04:10,303 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:04:10,306 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:04:10,306 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:04:10,310 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:04:10,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:04:04" (1/3) ... [2024-11-09 05:04:10,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29db73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:04:10, skipping insertion in model container [2024-11-09 05:04:10,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:05" (2/3) ... [2024-11-09 05:04:10,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29db73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:04:10, skipping insertion in model container [2024-11-09 05:04:10,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:04:10" (3/3) ... [2024-11-09 05:04:10,315 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test4-1.i [2024-11-09 05:04:10,340 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:04:10,341 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-09 05:04:10,448 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:04:10,459 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;@7d311e33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:04:10,459 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-09 05:04:10,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 130 states have (on average 1.7307692307692308) internal successors, (225), 146 states have internal predecessors, (225), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 05:04:10,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 05:04:10,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:04:10,479 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 05:04:10,480 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 05:04:10,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:04:10,488 INFO L85 PathProgramCache]: Analyzing trace with hash 49408974, now seen corresponding path program 1 times [2024-11-09 05:04:10,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:04:10,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608232924] [2024-11-09 05:04:10,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:04:10,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:04:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:04:10,745 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-09 05:04:10,746 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:04:10,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608232924] [2024-11-09 05:04:10,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608232924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:04:10,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:04:10,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:04:10,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106752559] [2024-11-09 05:04:10,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:04:10,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 05:04:10,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:04:10,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 05:04:10,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 05:04:10,797 INFO L87 Difference]: Start difference. First operand has 155 states, 130 states have (on average 1.7307692307692308) internal successors, (225), 146 states have internal predecessors, (225), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) 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-09 05:04:12,864 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-09 05:04:15,499 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-09 05:04:17,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:18,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:04:18,008 INFO L93 Difference]: Finished difference Result 308 states and 513 transitions. [2024-11-09 05:04:18,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 05:04:18,012 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-09 05:04:18,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:04:18,022 INFO L225 Difference]: With dead ends: 308 [2024-11-09 05:04:18,022 INFO L226 Difference]: Without dead ends: 152 [2024-11-09 05:04:18,026 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-09 05:04:18,030 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:04:18,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 3 Unknown, 0 Unchecked, 7.1s Time] [2024-11-09 05:04:18,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-09 05:04:18,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-09 05:04:18,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 129 states have (on average 1.248062015503876) internal successors, (161), 143 states have internal predecessors, (161), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 05:04:18,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 193 transitions. [2024-11-09 05:04:18,087 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 193 transitions. Word has length 4 [2024-11-09 05:04:18,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:04:18,087 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 193 transitions. [2024-11-09 05:04:18,088 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-09 05:04:18,088 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 193 transitions. [2024-11-09 05:04:18,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 05:04:18,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:04:18,089 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 05:04:18,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:04:18,090 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 05:04:18,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:04:18,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1531678254, now seen corresponding path program 1 times [2024-11-09 05:04:18,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:04:18,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765382560] [2024-11-09 05:04:18,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:04:18,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:04:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 05:04:18,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1139247745] [2024-11-09 05:04:18,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:04:18,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:04:18,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:04:18,132 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:04:18,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:04:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:04:18,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:04:18,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:04:18,426 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-09 05:04:18,427 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:04:18,427 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:04:18,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765382560] [2024-11-09 05:04:18,428 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 05:04:18,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139247745] [2024-11-09 05:04:18,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139247745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:04:18,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:04:18,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:04:18,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683124566] [2024-11-09 05:04:18,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:04:18,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:04:18,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:04:18,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:04:18,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:04:18,433 INFO L87 Difference]: Start difference. First operand 152 states and 193 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-09 05:04:20,470 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-09 05:04:22,486 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-09 05:04:24,571 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-09 05:04:25,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:28,499 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-09 05:04:29,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:31,682 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-09 05:04:33,685 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-09 05:04:35,703 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-09 05:04:37,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-09 05:04:39,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:04:39,462 INFO L93 Difference]: Finished difference Result 296 states and 378 transitions. [2024-11-09 05:04:39,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:04:39,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-09 05:04:39,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:04:39,472 INFO L225 Difference]: With dead ends: 296 [2024-11-09 05:04:39,472 INFO L226 Difference]: Without dead ends: 265 [2024-11-09 05:04:39,473 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-09 05:04:39,475 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 117 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:04:39,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 352 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 7 Unknown, 0 Unchecked, 21.0s Time] [2024-11-09 05:04:39,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-09 05:04:39,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 156. [2024-11-09 05:04:39,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 133 states have (on average 1.2406015037593985) internal successors, (165), 147 states have internal predecessors, (165), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 05:04:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 197 transitions. [2024-11-09 05:04:39,500 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 197 transitions. Word has length 5 [2024-11-09 05:04:39,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:04:39,501 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 197 transitions. [2024-11-09 05:04:39,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-09 05:04:39,501 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 197 transitions. [2024-11-09 05:04:39,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 05:04:39,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:04:39,504 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, 1, 1] [2024-11-09 05:04:39,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 05:04:39,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:04:39,710 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 05:04:39,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:04:39,710 INFO L85 PathProgramCache]: Analyzing trace with hash 733369133, now seen corresponding path program 1 times [2024-11-09 05:04:39,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:04:39,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020466868] [2024-11-09 05:04:39,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:04:39,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:04:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:04:40,562 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-09 05:04:40,563 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:04:40,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020466868] [2024-11-09 05:04:40,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020466868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:04:40,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:04:40,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:04:40,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673398374] [2024-11-09 05:04:40,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:04:40,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:04:40,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:04:40,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:04:40,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:04:40,573 INFO L87 Difference]: Start difference. First operand 156 states and 197 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 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-09 05:04:42,598 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-09 05:04:43,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:45,823 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-09 05:04:47,828 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-09 05:04:49,840 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-09 05:04:51,844 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-09 05:04:53,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:04:55,634 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-09 05:04:57,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:04:57,435 INFO L93 Difference]: Finished difference Result 323 states and 408 transitions. [2024-11-09 05:04:57,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:04:57,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 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 59 [2024-11-09 05:04:57,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:04:57,444 INFO L225 Difference]: With dead ends: 323 [2024-11-09 05:04:57,444 INFO L226 Difference]: Without dead ends: 172 [2024-11-09 05:04:57,445 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-09 05:04:57,447 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 6 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:04:57,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 334 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 6 Unknown, 0 Unchecked, 16.8s Time] [2024-11-09 05:04:57,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-09 05:04:57,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2024-11-09 05:04:57,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 149 states have (on average 1.2281879194630871) internal successors, (183), 163 states have internal predecessors, (183), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 05:04:57,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 215 transitions. [2024-11-09 05:04:57,467 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 215 transitions. Word has length 59 [2024-11-09 05:04:57,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:04:57,468 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 215 transitions. [2024-11-09 05:04:57,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 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-09 05:04:57,469 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 215 transitions. [2024-11-09 05:04:57,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 05:04:57,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:04:57,472 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, 1, 1] [2024-11-09 05:04:57,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:04:57,472 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 05:04:57,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:04:57,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1063300327, now seen corresponding path program 1 times [2024-11-09 05:04:57,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:04:57,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307898943] [2024-11-09 05:04:57,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:04:57,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:04:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:04:58,122 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-09 05:04:58,123 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:04:58,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307898943] [2024-11-09 05:04:58,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307898943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:04:58,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:04:58,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:04:58,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959517270] [2024-11-09 05:04:58,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:04:58,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:04:58,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:04:58,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:04:58,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:04:58,128 INFO L87 Difference]: Start difference. First operand 172 states and 215 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-09 05:05:00,155 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-09 05:05:02,166 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-09 05:05:04,215 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-09 05:05:06,226 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-09 05:05:09,172 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-09 05:05:11,177 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-09 05:05:13,188 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-09 05:05:15,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-09 05:05:17,258 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-09 05:05:19,262 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-09 05:05:21,270 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-09 05:05:23,279 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-09 05:05:25,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:05:25,160 INFO L93 Difference]: Finished difference Result 375 states and 469 transitions. [2024-11-09 05:05:25,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:05:25,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 72 [2024-11-09 05:05:25,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:05:25,166 INFO L225 Difference]: With dead ends: 375 [2024-11-09 05:05:25,167 INFO L226 Difference]: Without dead ends: 224 [2024-11-09 05:05:25,168 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-09 05:05:25,169 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 30 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:05:25,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 333 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 12 Unknown, 0 Unchecked, 27.0s Time] [2024-11-09 05:05:25,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-09 05:05:25,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2024-11-09 05:05:25,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 198 states have (on average 1.202020202020202) internal successors, (238), 212 states have internal predecessors, (238), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 05:05:25,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 276 transitions. [2024-11-09 05:05:25,192 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 276 transitions. Word has length 72 [2024-11-09 05:05:25,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:05:25,193 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 276 transitions. [2024-11-09 05:05:25,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-09 05:05:25,193 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 276 transitions. [2024-11-09 05:05:25,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 05:05:25,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:25,203 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, 1, 1] [2024-11-09 05:05:25,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:05:25,203 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 05:05:25,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:25,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1047040715, now seen corresponding path program 1 times [2024-11-09 05:05:25,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:05:25,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723385928] [2024-11-09 05:05:25,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:25,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:05:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:26,115 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-09 05:05:26,116 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:05:26,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723385928] [2024-11-09 05:05:26,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723385928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:05:26,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:05:26,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:05:26,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173105466] [2024-11-09 05:05:26,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:05:26,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:05:26,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:05:26,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:05:26,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:05:26,120 INFO L87 Difference]: Start difference. First operand 224 states and 276 transitions. Second operand has 4 states, 3 states have (on average 23.666666666666668) internal successors, (71), 4 states have internal predecessors, (71), 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-09 05:05:28,169 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-09 05:05:30,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:05:32,189 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-09 05:05:34,196 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-09 05:05:36,216 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-09 05:05:38,220 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-09 05:05:41,059 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-09 05:05:43,071 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-09 05:05:45,148 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-09 05:05:47,157 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-09 05:05:49,159 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-09 05:05:51,171 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-09 05:05:53,176 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-09 05:05:55,178 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-09 05:05:56,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-09 05:05:58,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:05:58,182 INFO L93 Difference]: Finished difference Result 265 states and 324 transitions. [2024-11-09 05:05:58,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:05:58,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.666666666666668) internal successors, (71), 4 states have internal predecessors, (71), 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 85 [2024-11-09 05:05:58,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:05:58,189 INFO L225 Difference]: With dead ends: 265 [2024-11-09 05:05:58,189 INFO L226 Difference]: Without dead ends: 263 [2024-11-09 05:05:58,190 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-09 05:05:58,191 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 49 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:05:58,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 487 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 13 Unknown, 0 Unchecked, 32.0s Time] [2024-11-09 05:05:58,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-09 05:05:58,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2024-11-09 05:05:58,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 234 states have (on average 1.188034188034188) internal successors, (278), 248 states have internal predecessors, (278), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 05:05:58,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 322 transitions. [2024-11-09 05:05:58,219 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 322 transitions. Word has length 85 [2024-11-09 05:05:58,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:05:58,219 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 322 transitions. [2024-11-09 05:05:58,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.666666666666668) internal successors, (71), 4 states have internal predecessors, (71), 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-09 05:05:58,220 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 322 transitions. [2024-11-09 05:05:58,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 05:05:58,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:58,224 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 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, 1] [2024-11-09 05:05:58,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 05:05:58,224 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 05:05:58,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:58,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1370223604, now seen corresponding path program 1 times [2024-11-09 05:05:58,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:05:58,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673084616] [2024-11-09 05:05:58,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:58,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:06:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:06:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 05:06:01,123 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:06:01,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673084616] [2024-11-09 05:06:01,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673084616] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:06:01,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113721233] [2024-11-09 05:06:01,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:06:01,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:06:01,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:06:01,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:06:01,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 05:06:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:06:17,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 05:06:17,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:06:17,958 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 05:06:17,961 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:06:17,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113721233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:06:17,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:06:17,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-09 05:06:17,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881966751] [2024-11-09 05:06:17,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:06:17,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:06:17,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:06:17,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:06:17,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:06:17,968 INFO L87 Difference]: Start difference. First operand 263 states and 322 transitions. Second operand has 4 states, 3 states have (on average 26.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 05:06:20,005 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-09 05:06:21,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 05:06:23,621 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-09 05:06:25,626 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-09 05:06:27,632 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-09 05:06:29,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-09 05:06:31,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-09 05:06:31,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:06:31,844 INFO L93 Difference]: Finished difference Result 504 states and 631 transitions. [2024-11-09 05:06:31,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:06:31,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 26.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 90 [2024-11-09 05:06:31,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:06:31,853 INFO L225 Difference]: With dead ends: 504 [2024-11-09 05:06:31,854 INFO L226 Difference]: Without dead ends: 265 [2024-11-09 05:06:31,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:06:31,856 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2024-11-09 05:06:31,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 494 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 4 Unknown, 0 Unchecked, 13.9s Time] [2024-11-09 05:06:31,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-09 05:06:31,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2024-11-09 05:06:31,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 235 states have (on average 1.1914893617021276) internal successors, (280), 250 states have internal predecessors, (280), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (26), 13 states have call predecessors, (26), 22 states have call successors, (26) [2024-11-09 05:06:31,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 328 transitions. [2024-11-09 05:06:31,881 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 328 transitions. Word has length 90 [2024-11-09 05:06:31,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:06:31,882 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 328 transitions. [2024-11-09 05:06:31,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 26.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 05:06:31,882 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 328 transitions. [2024-11-09 05:06:31,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 05:06:31,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:06:31,886 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 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, 1] [2024-11-09 05:06:31,949 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 05:06:32,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:06:32,087 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 05:06:32,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:06:32,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2010465012, now seen corresponding path program 1 times [2024-11-09 05:06:32,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:06:32,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091273026] [2024-11-09 05:06:32,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:06:32,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:06:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:06:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 05:06:35,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:06:35,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091273026] [2024-11-09 05:06:35,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091273026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:06:35,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189654636] [2024-11-09 05:06:35,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:06:35,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:06:35,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:06:35,029 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:06:35,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee1e1767-8023-4a51-9b5d-97e86e921fed/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 05:06:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:06:52,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 05:06:52,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:06:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 05:06:52,641 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:06:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 05:06:52,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189654636] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:06:52,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1539846194] [2024-11-09 05:06:52,802 INFO L159 IcfgInterpreter]: Started Sifa with 78 locations of interest [2024-11-09 05:06:52,802 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:06:52,807 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:06:52,813 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:06:52,814 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:07:58,920 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 9 for LOIs [2024-11-09 05:07:58,981 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:08:55,218 WARN L286 SmtUtils]: Spent 6.45s on a formula simplification that was a NOOP. DAG size: 176 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:09:04,771 WARN L286 SmtUtils]: Spent 6.25s on a formula simplification that was a NOOP. DAG size: 181 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:09:06,788 WARN L851 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main_~i~0#1| 9) (= |c_ULTIMATE.start_main_~user~0#1.offset| 0) (let ((.cse23 (exists ((|v_#Ultimate.C_memset_#t~loopctr309_34| Int)) (and (<= 384 (mod |v_#Ultimate.C_memset_#t~loopctr309_34| 4294967296)) (<= 0 |v_#Ultimate.C_memset_#t~loopctr309_34|))))) (or (and (exists ((|v_#valid_76| (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_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_184| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_185| (Array Int (Array Int Int))) (|v_#memory_int_199| (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_$Pointer$.offset_572| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_572| (Array Int (Array Int Int))) (|v_#memory_int_680| (Array Int (Array Int Int)))) (let ((.cse7 (select (select |v_#memory_$Pointer$.base_572| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse8 (+ (select (select |v_#memory_$Pointer$.offset_572| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 16)) (.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))) (let ((.cse20 (store |v_#memory_$Pointer$.offset_183| .cse10 (store (select |v_#memory_$Pointer$.offset_183| .cse10) .cse11 0))) (.cse16 (store |v_#memory_$Pointer$.base_183| .cse10 (store (select |v_#memory_$Pointer$.base_183| .cse10) .cse11 |v_ULTIMATE.start_main_#t~malloc57#1.base_6|))) (.cse4 (store |v_#memory_$Pointer$.offset_572| .cse7 (store (select |v_#memory_$Pointer$.offset_572| .cse7) .cse8 8))) (.cse19 (store |v_#memory_$Pointer$.base_572| .cse7 (store (select |v_#memory_$Pointer$.base_572| .cse7) .cse8 |c_ULTIMATE.start_main_~user~0#1.base|))) (.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 ((.cse2 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| .cse21) .cse22)) (.cse0 (select (select |v_#memory_$Pointer$.base_185| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse1 (+ (select (select |v_#memory_$Pointer$.offset_185| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 8)) (.cse3 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| .cse21) .cse22)) (.cse5 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse6 (+ (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4)) (.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse18 (+ 40 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (.cse13 (select (select |v_#memory_$Pointer$.base_184| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse14 (+ (select (select |v_#memory_$Pointer$.offset_184| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 20))) (and (= (store |v_#memory_$Pointer$.base_185| .cse0 (store (select |v_#memory_$Pointer$.base_185| .cse0) .cse1 (select (select |v_#memory_$Pointer$.base_184| .cse0) .cse1))) |v_#memory_$Pointer$.base_184|) (or (not (= .cse2 0)) (not (= .cse3 0))) (= (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 (select (select |v_#memory_$Pointer$.offset_185| .cse5) .cse6))) |v_#memory_$Pointer$.offset_185|) (= (store |v_#memory_int_680| .cse7 (store (select |v_#memory_int_680| .cse7) .cse8 (select (select |v_#memory_int_200| .cse7) .cse8))) |v_#memory_int_200|) (= .cse2 |c_ULTIMATE.start_main_#t~mem63#1.base|) (not (= |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 0)) (= (let ((.cse9 (let ((.cse12 (let ((.cse15 (store |v_#memory_int_200| .cse5 (store (select |v_#memory_int_200| .cse5) .cse6 32)))) (store .cse15 .cse0 (store (select .cse15 .cse0) .cse1 5))))) (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 8))))) (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 (select (select |v_#memory_int_199| .cse10) .cse11)))) |v_#memory_int_199|) (= |v_#memory_$Pointer$.offset_184| (store |v_#memory_$Pointer$.offset_185| .cse0 (store (select |v_#memory_$Pointer$.offset_185| .cse0) .cse1 (select (select |v_#memory_$Pointer$.offset_184| .cse0) .cse1)))) (= (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| .cse17) .cse18))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_43|) (= |c_ULTIMATE.start_main_#t~mem63#1.offset| .cse3) (= |v_#memory_$Pointer$.base_183| (store |v_#memory_$Pointer$.base_184| .cse13 (store (select |v_#memory_$Pointer$.base_184| .cse13) .cse14 (select (select |v_#memory_$Pointer$.base_183| .cse13) .cse14)))) (= (select |v_#valid_76| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0) (= |c_#valid| (store |v_#valid_76| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1)) (= (store .cse19 .cse5 (store (select .cse19 .cse5) .cse6 (select (select |v_#memory_$Pointer$.base_185| .cse5) .cse6))) |v_#memory_$Pointer$.base_185|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| (store .cse20 .cse17 (store (select .cse20 .cse17) .cse18 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| .cse17) .cse18)))) (<= (+ |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1) |c_#StackHeapBarrier|) (= |v_#memory_$Pointer$.offset_183| (store |v_#memory_$Pointer$.offset_184| .cse13 (store (select |v_#memory_$Pointer$.offset_184| .cse13) .cse14 (select (select |v_#memory_$Pointer$.offset_183| .cse13) .cse14)))) (= |c_#length| (store |v_#length_52| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 384))))))) .cse23) (and (exists ((|v_#valid_76| (Array Int Int)) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_44| (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_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_184| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_185| (Array Int (Array Int Int))) (|v_#memory_int_199| (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_$Pointer$.offset_572| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_572| (Array Int (Array Int Int))) (|v_#memory_int_680| (Array Int (Array Int Int)))) (let ((.cse32 (select (select |v_#memory_$Pointer$.base_572| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse33 (+ (select (select |v_#memory_$Pointer$.offset_572| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 16)) (.cse35 (select (select |v_#memory_$Pointer$.base_183| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse36 (select (select |v_#memory_$Pointer$.offset_183| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (let ((.cse44 (store |v_#memory_$Pointer$.offset_183| .cse35 (store (select |v_#memory_$Pointer$.offset_183| .cse35) .cse36 0))) (.cse26 (store |v_#memory_$Pointer$.base_183| .cse35 (store (select |v_#memory_$Pointer$.base_183| .cse35) .cse36 |v_ULTIMATE.start_main_#t~malloc57#1.base_6|))) (.cse29 (store |v_#memory_$Pointer$.offset_572| .cse32 (store (select |v_#memory_$Pointer$.offset_572| .cse32) .cse33 8))) (.cse43 (store |v_#memory_$Pointer$.base_572| .cse32 (store (select |v_#memory_$Pointer$.base_572| .cse32) .cse33 |c_ULTIMATE.start_main_~user~0#1.base|))) (.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))) (let ((.cse24 (select (select |v_#memory_$Pointer$.base_185| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse25 (+ (select (select |v_#memory_$Pointer$.offset_185| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 8)) (.cse42 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_72| .cse45) .cse46)) (.cse30 (select (select .cse43 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse31 (+ (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4)) (.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse28 (+ 40 (select (select .cse44 |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (.cse41 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_44| .cse45) .cse46)) (.cse38 (select (select |v_#memory_$Pointer$.base_184| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse39 (+ (select (select |v_#memory_$Pointer$.offset_184| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 20))) (and (= (store |v_#memory_$Pointer$.base_185| .cse24 (store (select |v_#memory_$Pointer$.base_185| .cse24) .cse25 (select (select |v_#memory_$Pointer$.base_184| .cse24) .cse25))) |v_#memory_$Pointer$.base_184|) (= |v_#memory_$Pointer$.base_BEFORE_CALL_72| (store .cse26 .cse27 (store (select .cse26 .cse27) .cse28 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_72| .cse27) .cse28)))) (= (store .cse29 .cse30 (store (select .cse29 .cse30) .cse31 (select (select |v_#memory_$Pointer$.offset_185| .cse30) .cse31))) |v_#memory_$Pointer$.offset_185|) (= (store |v_#memory_int_680| .cse32 (store (select |v_#memory_int_680| .cse32) .cse33 (select (select |v_#memory_int_200| .cse32) .cse33))) |v_#memory_int_200|) (not (= |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 0)) (= (let ((.cse34 (let ((.cse37 (let ((.cse40 (store |v_#memory_int_200| .cse30 (store (select |v_#memory_int_200| .cse30) .cse31 32)))) (store .cse40 .cse24 (store (select .cse40 .cse24) .cse25 5))))) (store .cse37 .cse38 (store (select .cse37 .cse38) .cse39 8))))) (store .cse34 .cse35 (store (select .cse34 .cse35) .cse36 (select (select |v_#memory_int_199| .cse35) .cse36)))) |v_#memory_int_199|) (= |v_#memory_$Pointer$.offset_184| (store |v_#memory_$Pointer$.offset_185| .cse24 (store (select |v_#memory_$Pointer$.offset_185| .cse24) .cse25 (select (select |v_#memory_$Pointer$.offset_184| .cse24) .cse25)))) (= |v_#memory_$Pointer$.base_183| (store |v_#memory_$Pointer$.base_184| .cse38 (store (select |v_#memory_$Pointer$.base_184| .cse38) .cse39 (select (select |v_#memory_$Pointer$.base_183| .cse38) .cse39)))) (= (select |v_#valid_76| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0) (= |c_#valid| (store |v_#valid_76| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1)) (or (not (= .cse41 0)) (not (= .cse42 0))) (= |c_ULTIMATE.start_main_#t~mem63#1.base| .cse42) (= (store .cse43 .cse30 (store (select .cse43 .cse30) .cse31 (select (select |v_#memory_$Pointer$.base_185| .cse30) .cse31))) |v_#memory_$Pointer$.base_185|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_44| (store .cse44 .cse27 (store (select .cse44 .cse27) .cse28 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_44| .cse27) .cse28)))) (= |c_ULTIMATE.start_main_#t~mem63#1.offset| .cse41) (<= (+ |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1) |c_#StackHeapBarrier|) (= |v_#memory_$Pointer$.offset_183| (store |v_#memory_$Pointer$.offset_184| .cse38 (store (select |v_#memory_$Pointer$.offset_184| .cse38) .cse39 (select (select |v_#memory_$Pointer$.offset_183| .cse38) .cse39)))) (= |c_#length| (store |v_#length_52| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 384))))))) .cse23)))) is different from false [2024-11-09 05:09:08,812 WARN L851 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main_~i~0#1| 9) (= |c_ULTIMATE.start_main_~user~0#1.offset| 0) (let ((.cse21 (exists ((|v_#Ultimate.C_memset_#t~loopctr309_34| Int)) (and (<= 384 (mod |v_#Ultimate.C_memset_#t~loopctr309_34| 4294967296)) (<= 0 |v_#Ultimate.C_memset_#t~loopctr309_34|))))) (or (and (exists ((|v_#valid_76| (Array Int Int)) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_44| (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_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_184| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_185| (Array Int (Array Int Int))) (|v_#memory_int_199| (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_$Pointer$.offset_572| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_572| (Array Int (Array Int Int))) (|v_#memory_int_680| (Array Int (Array Int Int)))) (let ((.cse8 (select (select |v_#memory_$Pointer$.base_572| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse9 (+ (select (select |v_#memory_$Pointer$.offset_572| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 16)) (.cse11 (select (select |v_#memory_$Pointer$.base_183| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse12 (select (select |v_#memory_$Pointer$.offset_183| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (let ((.cse20 (store |v_#memory_$Pointer$.offset_183| .cse11 (store (select |v_#memory_$Pointer$.offset_183| .cse11) .cse12 0))) (.cse2 (store |v_#memory_$Pointer$.base_183| .cse11 (store (select |v_#memory_$Pointer$.base_183| .cse11) .cse12 |v_ULTIMATE.start_main_#t~malloc57#1.base_6|))) (.cse5 (store |v_#memory_$Pointer$.offset_572| .cse8 (store (select |v_#memory_$Pointer$.offset_572| .cse8) .cse9 8))) (.cse19 (store |v_#memory_$Pointer$.base_572| .cse8 (store (select |v_#memory_$Pointer$.base_572| .cse8) .cse9 |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse0 (select (select |v_#memory_$Pointer$.base_185| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse1 (+ (select (select |v_#memory_$Pointer$.offset_185| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 8)) (.cse6 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse7 (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse4 (+ 40 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (.cse14 (select (select |v_#memory_$Pointer$.base_184| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse15 (+ (select (select |v_#memory_$Pointer$.offset_184| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 20))) (and (= (store |v_#memory_$Pointer$.base_185| .cse0 (store (select |v_#memory_$Pointer$.base_185| .cse0) .cse1 (select (select |v_#memory_$Pointer$.base_184| .cse0) .cse1))) |v_#memory_$Pointer$.base_184|) (= |v_#memory_$Pointer$.base_BEFORE_CALL_72| (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_72| .cse3) .cse4)))) (= (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 (select (select |v_#memory_$Pointer$.offset_185| .cse6) .cse7))) |v_#memory_$Pointer$.offset_185|) (= (store |v_#memory_int_680| .cse8 (store (select |v_#memory_int_680| .cse8) .cse9 (select (select |v_#memory_int_200| .cse8) .cse9))) |v_#memory_int_200|) (not (= |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 0)) (= (let ((.cse10 (let ((.cse13 (let ((.cse16 (store |v_#memory_int_200| .cse6 (store (select |v_#memory_int_200| .cse6) .cse7 32)))) (store .cse16 .cse0 (store (select .cse16 .cse0) .cse1 5))))) (store .cse13 .cse14 (store (select .cse13 .cse14) .cse15 8))))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 (select (select |v_#memory_int_199| .cse11) .cse12)))) |v_#memory_int_199|) (= |v_#memory_$Pointer$.offset_184| (store |v_#memory_$Pointer$.offset_185| .cse0 (store (select |v_#memory_$Pointer$.offset_185| .cse0) .cse1 (select (select |v_#memory_$Pointer$.offset_184| .cse0) .cse1)))) (= |v_#memory_$Pointer$.base_183| (store |v_#memory_$Pointer$.base_184| .cse14 (store (select |v_#memory_$Pointer$.base_184| .cse14) .cse15 (select (select |v_#memory_$Pointer$.base_183| .cse14) .cse15)))) (= (select |v_#valid_76| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0) (= |c_#valid| (store |v_#valid_76| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1)) (let ((.cse17 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_72| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse18 (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| .cse17) .cse18) 0)) (not (= (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_72| .cse17) .cse18) 0)))) (= (store .cse19 .cse6 (store (select .cse19 .cse6) .cse7 (select (select |v_#memory_$Pointer$.base_185| .cse6) .cse7))) |v_#memory_$Pointer$.base_185|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_44| (store .cse20 .cse3 (store (select .cse20 .cse3) .cse4 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_44| .cse3) .cse4)))) (<= (+ |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1) |c_#StackHeapBarrier|) (= |v_#memory_$Pointer$.offset_183| (store |v_#memory_$Pointer$.offset_184| .cse14 (store (select |v_#memory_$Pointer$.offset_184| .cse14) .cse15 (select (select |v_#memory_$Pointer$.offset_183| .cse14) .cse15)))) (= |c_#length| (store |v_#length_52| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 384))))))) .cse21) (and (exists ((|v_#valid_76| (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_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_184| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_185| (Array Int (Array Int Int))) (|v_#memory_int_199| (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_$Pointer$.offset_572| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_572| (Array Int (Array Int Int))) (|v_#memory_int_680| (Array Int (Array Int Int)))) (let ((.cse29 (select (select |v_#memory_$Pointer$.base_572| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse30 (+ (select (select |v_#memory_$Pointer$.offset_572| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 16)) (.cse32 (select (select |v_#memory_$Pointer$.base_183| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse33 (select (select |v_#memory_$Pointer$.offset_183| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (let ((.cse42 (store |v_#memory_$Pointer$.offset_183| .cse32 (store (select |v_#memory_$Pointer$.offset_183| .cse32) .cse33 0))) (.cse38 (store |v_#memory_$Pointer$.base_183| .cse32 (store (select |v_#memory_$Pointer$.base_183| .cse32) .cse33 |v_ULTIMATE.start_main_#t~malloc57#1.base_6|))) (.cse26 (store |v_#memory_$Pointer$.offset_572| .cse29 (store (select |v_#memory_$Pointer$.offset_572| .cse29) .cse30 8))) (.cse41 (store |v_#memory_$Pointer$.base_572| .cse29 (store (select |v_#memory_$Pointer$.base_572| .cse29) .cse30 |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse22 (select (select |v_#memory_$Pointer$.base_185| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse23 (+ (select (select |v_#memory_$Pointer$.offset_185| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 8)) (.cse27 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse28 (+ (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4)) (.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse40 (+ 40 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (.cse35 (select (select |v_#memory_$Pointer$.base_184| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse36 (+ (select (select |v_#memory_$Pointer$.offset_184| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 20))) (and (= (store |v_#memory_$Pointer$.base_185| .cse22 (store (select |v_#memory_$Pointer$.base_185| .cse22) .cse23 (select (select |v_#memory_$Pointer$.base_184| .cse22) .cse23))) |v_#memory_$Pointer$.base_184|) (let ((.cse24 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse25 (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| .cse24) .cse25) 0)) (not (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| .cse24) .cse25) 0)))) (= (store .cse26 .cse27 (store (select .cse26 .cse27) .cse28 (select (select |v_#memory_$Pointer$.offset_185| .cse27) .cse28))) |v_#memory_$Pointer$.offset_185|) (= (store |v_#memory_int_680| .cse29 (store (select |v_#memory_int_680| .cse29) .cse30 (select (select |v_#memory_int_200| .cse29) .cse30))) |v_#memory_int_200|) (not (= |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 0)) (= (let ((.cse31 (let ((.cse34 (let ((.cse37 (store |v_#memory_int_200| .cse27 (store (select |v_#memory_int_200| .cse27) .cse28 32)))) (store .cse37 .cse22 (store (select .cse37 .cse22) .cse23 5))))) (store .cse34 .cse35 (store (select .cse34 .cse35) .cse36 8))))) (store .cse31 .cse32 (store (select .cse31 .cse32) .cse33 (select (select |v_#memory_int_199| .cse32) .cse33)))) |v_#memory_int_199|) (= |v_#memory_$Pointer$.offset_184| (store |v_#memory_$Pointer$.offset_185| .cse22 (store (select |v_#memory_$Pointer$.offset_185| .cse22) .cse23 (select (select |v_#memory_$Pointer$.offset_184| .cse22) .cse23)))) (= (store .cse38 .cse39 (store (select .cse38 .cse39) .cse40 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| .cse39) .cse40))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_43|) (= |v_#memory_$Pointer$.base_183| (store |v_#memory_$Pointer$.base_184| .cse35 (store (select |v_#memory_$Pointer$.base_184| .cse35) .cse36 (select (select |v_#memory_$Pointer$.base_183| .cse35) .cse36)))) (= (select |v_#valid_76| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0) (= |c_#valid| (store |v_#valid_76| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1)) (= (store .cse41 .cse27 (store (select .cse41 .cse27) .cse28 (select (select |v_#memory_$Pointer$.base_185| .cse27) .cse28))) |v_#memory_$Pointer$.base_185|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| (store .cse42 .cse39 (store (select .cse42 .cse39) .cse40 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| .cse39) .cse40)))) (<= (+ |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1) |c_#StackHeapBarrier|) (= |v_#memory_$Pointer$.offset_183| (store |v_#memory_$Pointer$.offset_184| .cse35 (store (select |v_#memory_$Pointer$.offset_184| .cse35) .cse36 (select (select |v_#memory_$Pointer$.offset_183| .cse35) .cse36)))) (= |c_#length| (store |v_#length_52| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 384))))))) .cse21)))) is different from false [2024-11-09 05:10:18,220 WARN L286 SmtUtils]: Spent 26.67s 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-09 05:10:20,240 WARN L851 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main_~i~0#1| 9) (= |c_ULTIMATE.start_main_~user~0#1.offset| 0) (= |c_ULTIMATE.start_main_~users~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.offset_573| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_573| (Array Int (Array Int Int))) (|v_#memory_int_681| (Array Int (Array Int Int)))) (let ((.cse1 (+ 12 (select (select |v_#memory_$Pointer$.offset_573| |c_ULTIMATE.start_main_~users~0#1.base|) 8))) (.cse0 (select (select |v_#memory_$Pointer$.base_573| |c_ULTIMATE.start_main_~users~0#1.base|) 8))) (and (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_573| .cse0 (store (select |v_#memory_$Pointer$.base_573| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)))) (= (store |v_#memory_$Pointer$.offset_573| .cse0 (store (select |v_#memory_$Pointer$.offset_573| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) |c_#memory_$Pointer$.offset|) (= (store |v_#memory_int_681| .cse0 (let ((.cse2 (select |v_#memory_int_681| .cse0))) (store .cse2 .cse1 (+ (select .cse2 .cse1) 1)))) |c_#memory_int|)))) (= |c_ULTIMATE.start_main_~users~0#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) (let ((.cse24 (exists ((|v_#Ultimate.C_memset_#t~loopctr309_34| Int)) (and (<= 384 (mod |v_#Ultimate.C_memset_#t~loopctr309_34| 4294967296)) (<= 0 |v_#Ultimate.C_memset_#t~loopctr309_34|))))) (or (and (exists ((|v_#valid_76| (Array Int Int)) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_44| (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_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_184| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_185| (Array Int (Array Int Int))) (|v_#memory_int_199| (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_$Pointer$.offset_572| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_572| (Array Int (Array Int Int))) (|v_#memory_int_680| (Array Int (Array Int Int)))) (let ((.cse11 (select (select |v_#memory_$Pointer$.base_572| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse12 (+ (select (select |v_#memory_$Pointer$.offset_572| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 16)) (.cse14 (select (select |v_#memory_$Pointer$.base_183| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse15 (select (select |v_#memory_$Pointer$.offset_183| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (let ((.cse23 (store |v_#memory_$Pointer$.offset_183| .cse14 (store (select |v_#memory_$Pointer$.offset_183| .cse14) .cse15 0))) (.cse5 (store |v_#memory_$Pointer$.base_183| .cse14 (store (select |v_#memory_$Pointer$.base_183| .cse14) .cse15 |v_ULTIMATE.start_main_#t~malloc57#1.base_6|))) (.cse8 (store |v_#memory_$Pointer$.offset_572| .cse11 (store (select |v_#memory_$Pointer$.offset_572| .cse11) .cse12 8))) (.cse22 (store |v_#memory_$Pointer$.base_572| .cse11 (store (select |v_#memory_$Pointer$.base_572| .cse11) .cse12 |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse3 (select (select |v_#memory_$Pointer$.base_185| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse4 (+ (select (select |v_#memory_$Pointer$.offset_185| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 8)) (.cse9 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse10 (+ (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse7 (+ 40 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (.cse17 (select (select |v_#memory_$Pointer$.base_184| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse18 (+ (select (select |v_#memory_$Pointer$.offset_184| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 20))) (and (= (store |v_#memory_$Pointer$.base_185| .cse3 (store (select |v_#memory_$Pointer$.base_185| .cse3) .cse4 (select (select |v_#memory_$Pointer$.base_184| .cse3) .cse4))) |v_#memory_$Pointer$.base_184|) (= |v_#memory_$Pointer$.base_BEFORE_CALL_72| (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_72| .cse6) .cse7)))) (= (store .cse8 .cse9 (store (select .cse8 .cse9) .cse10 (select (select |v_#memory_$Pointer$.offset_185| .cse9) .cse10))) |v_#memory_$Pointer$.offset_185|) (= (store |v_#memory_int_680| .cse11 (store (select |v_#memory_int_680| .cse11) .cse12 (select (select |v_#memory_int_200| .cse11) .cse12))) |v_#memory_int_200|) (not (= |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 0)) (= (let ((.cse13 (let ((.cse16 (let ((.cse19 (store |v_#memory_int_200| .cse9 (store (select |v_#memory_int_200| .cse9) .cse10 32)))) (store .cse19 .cse3 (store (select .cse19 .cse3) .cse4 5))))) (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 8))))) (store .cse13 .cse14 (store (select .cse13 .cse14) .cse15 (select (select |v_#memory_int_199| .cse14) .cse15)))) |v_#memory_int_199|) (= |v_#memory_$Pointer$.offset_184| (store |v_#memory_$Pointer$.offset_185| .cse3 (store (select |v_#memory_$Pointer$.offset_185| .cse3) .cse4 (select (select |v_#memory_$Pointer$.offset_184| .cse3) .cse4)))) (= |v_#memory_$Pointer$.base_183| (store |v_#memory_$Pointer$.base_184| .cse17 (store (select |v_#memory_$Pointer$.base_184| .cse17) .cse18 (select (select |v_#memory_$Pointer$.base_183| .cse17) .cse18)))) (= (select |v_#valid_76| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0) (= |c_#valid| (store |v_#valid_76| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1)) (let ((.cse20 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_72| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse21 (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| .cse20) .cse21) 0)) (not (= (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_72| .cse20) .cse21) 0)))) (= (store .cse22 .cse9 (store (select .cse22 .cse9) .cse10 (select (select |v_#memory_$Pointer$.base_185| .cse9) .cse10))) |v_#memory_$Pointer$.base_185|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_44| (store .cse23 .cse6 (store (select .cse23 .cse6) .cse7 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_44| .cse6) .cse7)))) (<= (+ |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1) |c_#StackHeapBarrier|) (= |v_#memory_$Pointer$.offset_183| (store |v_#memory_$Pointer$.offset_184| .cse17 (store (select |v_#memory_$Pointer$.offset_184| .cse17) .cse18 (select (select |v_#memory_$Pointer$.offset_183| .cse17) .cse18)))) (= |c_#length| (store |v_#length_52| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 384))))))) .cse24) (and (exists ((|v_#valid_76| (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_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_184| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_185| (Array Int (Array Int Int))) (|v_#memory_int_199| (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_$Pointer$.offset_572| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_572| (Array Int (Array Int Int))) (|v_#memory_int_680| (Array Int (Array Int Int)))) (let ((.cse32 (select (select |v_#memory_$Pointer$.base_572| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse33 (+ (select (select |v_#memory_$Pointer$.offset_572| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 16)) (.cse35 (select (select |v_#memory_$Pointer$.base_183| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse36 (select (select |v_#memory_$Pointer$.offset_183| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (let ((.cse45 (store |v_#memory_$Pointer$.offset_183| .cse35 (store (select |v_#memory_$Pointer$.offset_183| .cse35) .cse36 0))) (.cse41 (store |v_#memory_$Pointer$.base_183| .cse35 (store (select |v_#memory_$Pointer$.base_183| .cse35) .cse36 |v_ULTIMATE.start_main_#t~malloc57#1.base_6|))) (.cse29 (store |v_#memory_$Pointer$.offset_572| .cse32 (store (select |v_#memory_$Pointer$.offset_572| .cse32) .cse33 8))) (.cse44 (store |v_#memory_$Pointer$.base_572| .cse32 (store (select |v_#memory_$Pointer$.base_572| .cse32) .cse33 |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse25 (select (select |v_#memory_$Pointer$.base_185| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse26 (+ (select (select |v_#memory_$Pointer$.offset_185| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 8)) (.cse30 (select (select .cse44 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse31 (+ (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4)) (.cse42 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse43 (+ 40 (select (select .cse45 |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (.cse38 (select (select |v_#memory_$Pointer$.base_184| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse39 (+ (select (select |v_#memory_$Pointer$.offset_184| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 20))) (and (= (store |v_#memory_$Pointer$.base_185| .cse25 (store (select |v_#memory_$Pointer$.base_185| .cse25) .cse26 (select (select |v_#memory_$Pointer$.base_184| .cse25) .cse26))) |v_#memory_$Pointer$.base_184|) (let ((.cse27 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse28 (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| .cse27) .cse28) 0)) (not (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| .cse27) .cse28) 0)))) (= (store .cse29 .cse30 (store (select .cse29 .cse30) .cse31 (select (select |v_#memory_$Pointer$.offset_185| .cse30) .cse31))) |v_#memory_$Pointer$.offset_185|) (= (store |v_#memory_int_680| .cse32 (store (select |v_#memory_int_680| .cse32) .cse33 (select (select |v_#memory_int_200| .cse32) .cse33))) |v_#memory_int_200|) (not (= |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 0)) (= (let ((.cse34 (let ((.cse37 (let ((.cse40 (store |v_#memory_int_200| .cse30 (store (select |v_#memory_int_200| .cse30) .cse31 32)))) (store .cse40 .cse25 (store (select .cse40 .cse25) .cse26 5))))) (store .cse37 .cse38 (store (select .cse37 .cse38) .cse39 8))))) (store .cse34 .cse35 (store (select .cse34 .cse35) .cse36 (select (select |v_#memory_int_199| .cse35) .cse36)))) |v_#memory_int_199|) (= |v_#memory_$Pointer$.offset_184| (store |v_#memory_$Pointer$.offset_185| .cse25 (store (select |v_#memory_$Pointer$.offset_185| .cse25) .cse26 (select (select |v_#memory_$Pointer$.offset_184| .cse25) .cse26)))) (= (store .cse41 .cse42 (store (select .cse41 .cse42) .cse43 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_43| .cse42) .cse43))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_43|) (= |v_#memory_$Pointer$.base_183| (store |v_#memory_$Pointer$.base_184| .cse38 (store (select |v_#memory_$Pointer$.base_184| .cse38) .cse39 (select (select |v_#memory_$Pointer$.base_183| .cse38) .cse39)))) (= (select |v_#valid_76| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0) (= |c_#valid| (store |v_#valid_76| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1)) (= (store .cse44 .cse30 (store (select .cse44 .cse30) .cse31 (select (select |v_#memory_$Pointer$.base_185| .cse30) .cse31))) |v_#memory_$Pointer$.base_185|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| (store .cse45 .cse42 (store (select .cse45 .cse42) .cse43 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_43| .cse42) .cse43)))) (<= (+ |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 1) |c_#StackHeapBarrier|) (= |v_#memory_$Pointer$.offset_183| (store |v_#memory_$Pointer$.offset_184| .cse38 (store (select |v_#memory_$Pointer$.offset_184| .cse38) .cse39 (select (select |v_#memory_$Pointer$.offset_183| .cse38) .cse39)))) (= |c_#length| (store |v_#length_52| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| 384))))))) .cse24)))) is different from false [2024-11-09 05:12:52,533 WARN L286 SmtUtils]: Spent 1.73m on a formula simplification that was a NOOP. DAG size: 275 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:14:11,301 WARN L286 SmtUtils]: Spent 6.16s 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-09 05:14:27,342 WARN L286 SmtUtils]: Spent 9.93s 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-09 05:14:29,364 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~count_int_int~0 0) (= |c_ULTIMATE.start_main_~user~0#1.offset| 0) (= |c_ULTIMATE.start_main_~users~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (let ((.cse23 (exists ((|v_#Ultimate.C_memset_#t~loopctr309_34| Int)) (and (<= 384 (mod |v_#Ultimate.C_memset_#t~loopctr309_34| 4294967296)) (<= 0 |v_#Ultimate.C_memset_#t~loopctr309_34|))))) (or (and (exists ((|v_#valid_73| (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc206#1.base_6| Int) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_39| (Array Int (Array Int Int))) (|v_#length_49| (Array Int Int)) (|v_#memory_$Pointer$.offset_180| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_180| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| (Array Int (Array Int Int))) (|v_#memory_int_672| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_564| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_179| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_178| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_178| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_564| (Array Int (Array Int Int))) (|v_#memory_int_196| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_179| (Array Int (Array Int Int))) (|v_#memory_int_197| (Array Int (Array Int Int)))) (let ((.cse10 (select (select |v_#memory_$Pointer$.base_564| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse11 (+ 16 (select (select |v_#memory_$Pointer$.offset_564| |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (.cse16 (select (select |v_#memory_$Pointer$.base_179| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse17 (select (select |v_#memory_$Pointer$.offset_179| |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (let ((.cse20 (store |v_#memory_$Pointer$.offset_179| .cse16 (store (select |v_#memory_$Pointer$.offset_179| .cse16) .cse17 0))) (.cse12 (store |v_#memory_$Pointer$.base_179| .cse16 (store (select |v_#memory_$Pointer$.base_179| .cse16) .cse17 |v_ULTIMATE.start_main_#t~malloc206#1.base_6|))) (.cse8 (store |v_#memory_$Pointer$.offset_564| .cse10 (store (select |v_#memory_$Pointer$.offset_564| .cse10) .cse11 40))) (.cse5 (store |v_#memory_$Pointer$.base_564| .cse10 (store (select |v_#memory_$Pointer$.base_564| .cse10) .cse11 |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse21 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_39| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse22 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (let ((.cse0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_39| .cse21) .cse22)) (.cse9 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| .cse21) .cse22)) (.cse3 (select (select |v_#memory_$Pointer$.base_180| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse4 (+ (select (select |v_#memory_$Pointer$.offset_180| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 20)) (.cse1 (select (select |v_#memory_$Pointer$.base_178| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse2 (+ (select (select |v_#memory_$Pointer$.offset_178| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 8)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse7 (+ (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) 40) 4)) (.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse14 (+ 40 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) 40)))) (and (not (= |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 0)) (= |c_ULTIMATE.start_main_#t~mem212#1.base| .cse0) (= (store |v_#memory_$Pointer$.offset_178| .cse1 (store (select |v_#memory_$Pointer$.offset_178| .cse1) .cse2 (select (select |v_#memory_$Pointer$.offset_180| .cse1) .cse2))) |v_#memory_$Pointer$.offset_180|) (= (select |v_#valid_73| |v_ULTIMATE.start_main_#t~malloc206#1.base_6|) 0) (= (store |v_#memory_$Pointer$.offset_180| .cse3 (store (select |v_#memory_$Pointer$.offset_180| .cse3) .cse4 (select (select |v_#memory_$Pointer$.offset_179| .cse3) .cse4))) |v_#memory_$Pointer$.offset_179|) (= (store |v_#memory_$Pointer$.base_178| .cse1 (store (select |v_#memory_$Pointer$.base_178| .cse1) .cse2 (select (select |v_#memory_$Pointer$.base_180| .cse1) .cse2))) |v_#memory_$Pointer$.base_180|) (= (store |v_#length_49| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 384) |c_#length|) (= (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 (select (select |v_#memory_$Pointer$.base_178| .cse6) .cse7))) |v_#memory_$Pointer$.base_178|) (= (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 (select (select |v_#memory_$Pointer$.offset_178| .cse6) .cse7))) |v_#memory_$Pointer$.offset_178|) (<= (+ |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |v_#valid_73| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1)) (= (store |v_#memory_$Pointer$.base_180| .cse3 (store (select |v_#memory_$Pointer$.base_180| .cse3) .cse4 (select (select |v_#memory_$Pointer$.base_179| .cse3) .cse4))) |v_#memory_$Pointer$.base_179|) (= |c_ULTIMATE.start_main_#t~mem212#1.offset| .cse9) (= |v_#memory_int_196| (store |v_#memory_int_672| .cse10 (store (select |v_#memory_int_672| .cse10) .cse11 (select (select |v_#memory_int_196| .cse10) .cse11)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_39| (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_39| .cse13) .cse14)))) (or (not (= .cse0 0)) (not (= .cse9 0))) (= (let ((.cse15 (let ((.cse18 (let ((.cse19 (store |v_#memory_int_196| .cse6 (store (select |v_#memory_int_196| .cse6) .cse7 32)))) (store .cse19 .cse1 (store (select .cse19 .cse1) .cse2 5))))) (store .cse18 .cse3 (store (select .cse18 .cse3) .cse4 40))))) (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 (select (select |v_#memory_int_197| .cse16) .cse17)))) |v_#memory_int_197|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| (store .cse20 .cse13 (store (select .cse20 .cse13) .cse14 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| .cse13) .cse14))))))))) .cse23) (and (exists ((|v_#valid_73| (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc206#1.base_6| Int) (|v_#length_49| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_40| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_180| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_180| (Array Int (Array Int Int))) (|v_#memory_int_672| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_BEFORE_CALL_64| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_564| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_179| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_178| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_178| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_564| (Array Int (Array Int Int))) (|v_#memory_int_196| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_179| (Array Int (Array Int Int))) (|v_#memory_int_197| (Array Int (Array Int Int)))) (let ((.cse41 (select (select |v_#memory_$Pointer$.base_179| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse42 (select (select |v_#memory_$Pointer$.offset_179| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse38 (select (select |v_#memory_$Pointer$.base_564| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse39 (+ 16 (select (select |v_#memory_$Pointer$.offset_564| |c_ULTIMATE.start_main_~user~0#1.base|) 40)))) (let ((.cse45 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_40| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse46 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_64| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse37 (store |v_#memory_$Pointer$.offset_564| .cse38 (store (select |v_#memory_$Pointer$.offset_564| .cse38) .cse39 40))) (.cse34 (store |v_#memory_$Pointer$.base_564| .cse38 (store (select |v_#memory_$Pointer$.base_564| .cse38) .cse39 |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse32 (store |v_#memory_$Pointer$.offset_179| .cse41 (store (select |v_#memory_$Pointer$.offset_179| .cse41) .cse42 0))) (.cse24 (store |v_#memory_$Pointer$.base_179| .cse41 (store (select |v_#memory_$Pointer$.base_179| .cse41) .cse42 |v_ULTIMATE.start_main_#t~malloc206#1.base_6|)))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse26 (+ 40 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (.cse30 (select (select |v_#memory_$Pointer$.base_180| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse31 (+ (select (select |v_#memory_$Pointer$.offset_180| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 20)) (.cse27 (select (select |v_#memory_$Pointer$.base_178| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse28 (+ (select (select |v_#memory_$Pointer$.offset_178| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 8)) (.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse36 (+ (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) 40) 4)) (.cse29 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_64| .cse45) .cse46)) (.cse33 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_40| .cse45) .cse46))) (and (= (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_40| .cse25) .cse26))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_40|) (not (= |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 0)) (= (store |v_#memory_$Pointer$.offset_178| .cse27 (store (select |v_#memory_$Pointer$.offset_178| .cse27) .cse28 (select (select |v_#memory_$Pointer$.offset_180| .cse27) .cse28))) |v_#memory_$Pointer$.offset_180|) (= |c_ULTIMATE.start_main_#t~mem212#1.offset| .cse29) (= (select |v_#valid_73| |v_ULTIMATE.start_main_#t~malloc206#1.base_6|) 0) (= (store |v_#memory_$Pointer$.offset_180| .cse30 (store (select |v_#memory_$Pointer$.offset_180| .cse30) .cse31 (select (select |v_#memory_$Pointer$.offset_179| .cse30) .cse31))) |v_#memory_$Pointer$.offset_179|) (= (store |v_#memory_$Pointer$.base_178| .cse27 (store (select |v_#memory_$Pointer$.base_178| .cse27) .cse28 (select (select |v_#memory_$Pointer$.base_180| .cse27) .cse28))) |v_#memory_$Pointer$.base_180|) (= (store |v_#length_49| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 384) |c_#length|) (= |v_#memory_$Pointer$.offset_BEFORE_CALL_64| (store .cse32 .cse25 (store (select .cse32 .cse25) .cse26 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_64| .cse25) .cse26)))) (= |c_ULTIMATE.start_main_#t~mem212#1.base| .cse33) (= (store .cse34 .cse35 (store (select .cse34 .cse35) .cse36 (select (select |v_#memory_$Pointer$.base_178| .cse35) .cse36))) |v_#memory_$Pointer$.base_178|) (= (store .cse37 .cse35 (store (select .cse37 .cse35) .cse36 (select (select |v_#memory_$Pointer$.offset_178| .cse35) .cse36))) |v_#memory_$Pointer$.offset_178|) (<= (+ |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |v_#valid_73| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1)) (= (store |v_#memory_$Pointer$.base_180| .cse30 (store (select |v_#memory_$Pointer$.base_180| .cse30) .cse31 (select (select |v_#memory_$Pointer$.base_179| .cse30) .cse31))) |v_#memory_$Pointer$.base_179|) (= |v_#memory_int_196| (store |v_#memory_int_672| .cse38 (store (select |v_#memory_int_672| .cse38) .cse39 (select (select |v_#memory_int_196| .cse38) .cse39)))) (= (let ((.cse40 (let ((.cse43 (let ((.cse44 (store |v_#memory_int_196| .cse35 (store (select |v_#memory_int_196| .cse35) .cse36 32)))) (store .cse44 .cse27 (store (select .cse44 .cse27) .cse28 5))))) (store .cse43 .cse30 (store (select .cse43 .cse30) .cse31 40))))) (store .cse40 .cse41 (store (select .cse40 .cse41) .cse42 (select (select |v_#memory_int_197| .cse41) .cse42)))) |v_#memory_int_197|) (or (not (= .cse29 0)) (not (= .cse33 0)))))))) .cse23))) (<= 0 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2024-11-09 05:16:01,298 WARN L286 SmtUtils]: Spent 27.39s 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-09 05:17:22,274 WARN L286 SmtUtils]: Spent 40.30s on a formula simplification that was a NOOP. DAG size: 216 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)