./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-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_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/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_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/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_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:44:50,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:44:50,441 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Overflow-32bit-Taipan_Default.epf [2024-11-09 04:44:50,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:44:50,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:44:50,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:44:50,489 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:44:50,490 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:44:50,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:44:50,492 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:44:50,493 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:44:50,493 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:44:50,493 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:44:50,494 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 04:44:50,494 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:44:50,496 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:44:50,497 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 04:44:50,497 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 04:44:50,497 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:44:50,498 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 04:44:50,498 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 04:44:50,503 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 04:44:50,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:44:50,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:44:50,504 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:44:50,504 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:44:50,504 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:44:50,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:44:50,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:44:50,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:44:50,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:44:50,506 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:44:50,506 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 04:44:50,506 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 04:44:50,506 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:44:50,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:44:50,507 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:44:50,507 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:44:50,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:44:50,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:44:50,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:44:50,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:44:50,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:44:50,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:44:50,511 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 04:44:50,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:44:50,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:44:50,512 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:44:50,513 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:44:50,513 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_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/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_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2024-11-09 04:44:50,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:44:50,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:44:50,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:44:50,830 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:44:50,831 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:44:50,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-1.i Unable to find full path for "g++" [2024-11-09 04:44:52,844 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:44:53,141 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:44:53,142 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-1.i [2024-11-09 04:44:53,160 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/bin/utaipan-verify-YMUCfTKeje/data/6cd5d7203/6492e4966bab415ba18605ec040cb930/FLAG36961974e [2024-11-09 04:44:53,417 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/bin/utaipan-verify-YMUCfTKeje/data/6cd5d7203/6492e4966bab415ba18605ec040cb930 [2024-11-09 04:44:53,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:44:53,421 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:44:53,422 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:44:53,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:44:53,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:44:53,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:44:53" (1/1) ... [2024-11-09 04:44:53,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17db7345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:53, skipping insertion in model container [2024-11-09 04:44:53,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:44:53" (1/1) ... [2024-11-09 04:44:53,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:44:54,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:44:54,183 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:44:54,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:44:54,380 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:44:54,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:54 WrapperNode [2024-11-09 04:44:54,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:44:54,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:44:54,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:44:54,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:44:54,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:54" (1/1) ... [2024-11-09 04:44:54,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:54" (1/1) ... [2024-11-09 04:44:54,474 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 787 [2024-11-09 04:44:54,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:44:54,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:44:54,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:44:54,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:44:54,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:54" (1/1) ... [2024-11-09 04:44:54,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:54" (1/1) ... [2024-11-09 04:44:54,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:54" (1/1) ... [2024-11-09 04:44:54,502 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:54" (1/1) ... [2024-11-09 04:44:54,533 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:54" (1/1) ... [2024-11-09 04:44:54,542 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:54" (1/1) ... [2024-11-09 04:44:54,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:54" (1/1) ... [2024-11-09 04:44:54,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:54" (1/1) ... [2024-11-09 04:44:54,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:44:54,567 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:44:54,567 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:44:54,567 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:44:54,568 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:54" (1/1) ... [2024-11-09 04:44:54,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:44:54,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:44:54,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:44:54,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:44:54,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 04:44:54,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 04:44:54,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-09 04:44:54,664 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-09 04:44:54,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 04:44:54,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:44:54,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 04:44:54,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 04:44:54,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 04:44:54,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 04:44:54,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:44:54,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:44:54,862 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:44:54,864 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:44:56,057 INFO L? ?]: Removed 207 outVars from TransFormulas that were not future-live. [2024-11-09 04:44:56,057 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:44:56,967 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:44:56,968 INFO L316 CfgBuilder]: Removed 27 assume(true) statements. [2024-11-09 04:44:56,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:44:56 BoogieIcfgContainer [2024-11-09 04:44:56,969 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:44:56,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:44:56,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:44:56,978 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:44:56,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:44:53" (1/3) ... [2024-11-09 04:44:56,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d1cb69e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:44:56, skipping insertion in model container [2024-11-09 04:44:56,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:54" (2/3) ... [2024-11-09 04:44:56,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d1cb69e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:44:56, skipping insertion in model container [2024-11-09 04:44:56,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:44:56" (3/3) ... [2024-11-09 04:44:56,982 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test1-1.i [2024-11-09 04:44:57,002 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:44:57,003 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-09 04:44:57,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:44:57,098 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;@2c05b064, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:44:57,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-09 04:44:57,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 67 states have (on average 1.7164179104477613) internal successors, (115), 73 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:44:57,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 04:44:57,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:44:57,115 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 04:44:57,116 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 04:44:57,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:44:57,126 INFO L85 PathProgramCache]: Analyzing trace with hash 25331491, now seen corresponding path program 1 times [2024-11-09 04:44:57,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:44:57,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902554635] [2024-11-09 04:44:57,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:44:57,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:44:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:44:57,724 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 04:44:57,724 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:44:57,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902554635] [2024-11-09 04:44:57,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902554635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:44:57,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:44:57,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:44:57,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8535349] [2024-11-09 04:44:57,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:44:57,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:44:57,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:44:57,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:44:57,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:44:57,770 INFO L87 Difference]: Start difference. First operand has 78 states, 67 states have (on average 1.7164179104477613) internal successors, (115), 73 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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 04:44:59,860 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 04:45:01,866 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 04:45:03,870 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 04:45:05,882 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 04:45:07,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:07,228 INFO L93 Difference]: Finished difference Result 165 states and 259 transitions. [2024-11-09 04:45:07,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:45:07,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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 04:45:07,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:07,239 INFO L225 Difference]: With dead ends: 165 [2024-11-09 04:45:07,239 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 04:45:07,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:45:07,244 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 10 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:07,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 149 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 4 Unknown, 0 Unchecked, 9.4s Time] [2024-11-09 04:45:07,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 04:45:07,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2024-11-09 04:45:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 74 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:45:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2024-11-09 04:45:07,288 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 4 [2024-11-09 04:45:07,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:07,289 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2024-11-09 04:45:07,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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 04:45:07,289 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2024-11-09 04:45:07,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 04:45:07,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:07,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 04:45:07,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:45:07,291 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 04:45:07,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:07,291 INFO L85 PathProgramCache]: Analyzing trace with hash 785276281, now seen corresponding path program 1 times [2024-11-09 04:45:07,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:07,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396364688] [2024-11-09 04:45:07,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:07,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:07,398 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 04:45:07,398 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:07,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396364688] [2024-11-09 04:45:07,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396364688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:07,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:07,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:45:07,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371132634] [2024-11-09 04:45:07,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:07,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:45:07,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:07,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:45:07,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:45:07,402 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:45:09,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:45:11,453 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 04:45:12,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:45:14,890 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 04:45:16,898 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 04:45:18,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:45:19,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:19,214 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2024-11-09 04:45:19,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:45:19,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 04:45:19,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:19,218 INFO L225 Difference]: With dead ends: 86 [2024-11-09 04:45:19,218 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 04:45:19,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:45:19,219 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 6 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:19,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 144 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 4 Unknown, 0 Unchecked, 11.8s Time] [2024-11-09 04:45:19,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 04:45:19,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2024-11-09 04:45:19,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 75 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:45:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2024-11-09 04:45:19,230 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 5 [2024-11-09 04:45:19,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:19,230 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2024-11-09 04:45:19,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:45:19,231 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2024-11-09 04:45:19,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 04:45:19,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:19,231 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 04:45:19,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 04:45:19,232 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 04:45:19,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:19,233 INFO L85 PathProgramCache]: Analyzing trace with hash -747860126, now seen corresponding path program 1 times [2024-11-09 04:45:19,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:19,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122885598] [2024-11-09 04:45:19,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:19,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:19,277 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 04:45:19,277 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:19,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122885598] [2024-11-09 04:45:19,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122885598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:19,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:19,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:45:19,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029282033] [2024-11-09 04:45:19,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:19,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:45:19,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:19,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:45:19,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:45:19,279 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 04:45:20,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:45:22,444 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 04:45:24,531 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 04:45:26,541 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 04:45:28,552 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 04:45:29,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:29,594 INFO L93 Difference]: Finished difference Result 142 states and 166 transitions. [2024-11-09 04:45:29,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:45:29,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2024-11-09 04:45:29,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:29,599 INFO L225 Difference]: With dead ends: 142 [2024-11-09 04:45:29,599 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 04:45:29,601 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 04:45:29,602 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 62 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:29,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 145 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 4 Unknown, 0 Unchecked, 10.3s Time] [2024-11-09 04:45:29,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 04:45:29,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 80. [2024-11-09 04:45:29,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 75 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:45:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2024-11-09 04:45:29,616 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 6 [2024-11-09 04:45:29,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:29,617 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2024-11-09 04:45:29,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 04:45:29,617 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2024-11-09 04:45:29,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 04:45:29,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:29,618 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] [2024-11-09 04:45:29,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 04:45:29,619 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 04:45:29,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:29,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1000216892, now seen corresponding path program 1 times [2024-11-09 04:45:29,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:29,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246212819] [2024-11-09 04:45:29,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:29,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:29,891 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 04:45:29,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:29,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246212819] [2024-11-09 04:45:29,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246212819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:29,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:29,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:45:29,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111118417] [2024-11-09 04:45:29,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:29,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:45:29,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:29,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:45:29,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:45:29,895 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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 04:45:32,370 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 04:45:34,672 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 04:45:36,684 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 04:45:38,689 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 04:45:40,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:40,052 INFO L93 Difference]: Finished difference Result 171 states and 198 transitions. [2024-11-09 04:45:40,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:45:40,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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 33 [2024-11-09 04:45:40,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:40,060 INFO L225 Difference]: With dead ends: 171 [2024-11-09 04:45:40,060 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 04:45:40,060 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 04:45:40,062 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:40,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 145 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 4 Unknown, 0 Unchecked, 10.1s Time] [2024-11-09 04:45:40,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 04:45:40,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-09 04:45:40,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 86 states have (on average 1.2093023255813953) internal successors, (104), 91 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:45:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2024-11-09 04:45:40,075 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 33 [2024-11-09 04:45:40,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:40,075 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2024-11-09 04:45:40,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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 04:45:40,076 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2024-11-09 04:45:40,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 04:45:40,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:40,078 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] [2024-11-09 04:45:40,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 04:45:40,078 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 04:45:40,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:40,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1737890390, now seen corresponding path program 1 times [2024-11-09 04:45:40,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:40,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651698722] [2024-11-09 04:45:40,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:40,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:40,476 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 04:45:40,477 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:40,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651698722] [2024-11-09 04:45:40,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651698722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:40,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:40,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:45:40,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482972260] [2024-11-09 04:45:40,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:40,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:45:40,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:40,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:45:40,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:45:40,483 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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 04:45:42,516 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 04:45:44,522 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 04:45:46,533 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 04:45:48,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:48,277 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2024-11-09 04:45:48,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:45:48,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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 46 [2024-11-09 04:45:48,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:48,285 INFO L225 Difference]: With dead ends: 96 [2024-11-09 04:45:48,285 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 04:45:48,285 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 04:45:48,286 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 30 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:48,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 148 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 3 Unknown, 0 Unchecked, 7.8s Time] [2024-11-09 04:45:48,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 04:45:48,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-09 04:45:48,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 86 states have (on average 1.197674418604651) internal successors, (103), 90 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:45:48,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2024-11-09 04:45:48,310 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 46 [2024-11-09 04:45:48,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:48,311 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2024-11-09 04:45:48,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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 04:45:48,312 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2024-11-09 04:45:48,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 04:45:48,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:48,313 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] [2024-11-09 04:45:48,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 04:45:48,314 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 04:45:48,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:48,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1959971980, now seen corresponding path program 1 times [2024-11-09 04:45:48,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:48,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542840762] [2024-11-09 04:45:48,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:48,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:48,693 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 04:45:48,693 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:48,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542840762] [2024-11-09 04:45:48,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542840762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:48,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:48,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:45:48,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639009550] [2024-11-09 04:45:48,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:48,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:45:48,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:48,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:45:48,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:45:48,699 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 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 04:45:50,723 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 04:45:52,729 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 04:45:54,738 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 04:45:56,740 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 04:45:59,564 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 04:46:01,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:46:02,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:46:02,701 INFO L93 Difference]: Finished difference Result 135 states and 156 transitions. [2024-11-09 04:46:02,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:46:02,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 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 47 [2024-11-09 04:46:02,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:46:02,711 INFO L225 Difference]: With dead ends: 135 [2024-11-09 04:46:02,711 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 04:46:02,712 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 04:46:02,714 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 24 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:46:02,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 210 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 5 Unknown, 0 Unchecked, 14.0s Time] [2024-11-09 04:46:02,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 04:46:02,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-09 04:46:02,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 122 states have (on average 1.1721311475409837) internal successors, (143), 126 states have internal predecessors, (143), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 04:46:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 155 transitions. [2024-11-09 04:46:02,742 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 155 transitions. Word has length 47 [2024-11-09 04:46:02,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:46:02,747 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 155 transitions. [2024-11-09 04:46:02,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 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 04:46:02,747 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 155 transitions. [2024-11-09 04:46:02,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 04:46:02,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:46:02,757 INFO L215 NwaCegarLoop]: trace histogram [2, 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] [2024-11-09 04:46:02,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 04:46:02,758 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 04:46:02,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:46:02,758 INFO L85 PathProgramCache]: Analyzing trace with hash 555201663, now seen corresponding path program 1 times [2024-11-09 04:46:02,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:46:02,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220589626] [2024-11-09 04:46:02,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:02,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:46:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:04,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 04:46:04,004 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:46:04,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220589626] [2024-11-09 04:46:04,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220589626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:46:04,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68321077] [2024-11-09 04:46:04,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:04,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:46:04,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:46:04,009 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:46:04,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 04:46:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:04,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 04:46:04,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:46:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 04:46:04,719 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:46:04,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 04:46:04,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68321077] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:46:04,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1589871621] [2024-11-09 04:46:04,975 INFO L159 IcfgInterpreter]: Started Sifa with 45 locations of interest [2024-11-09 04:46:04,976 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:46:04,979 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:46:04,984 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:46:04,985 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:46:08,250 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 204 for LOIs [2024-11-09 04:46:08,379 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:46:37,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1589871621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:46:37,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:46:37,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [5, 5, 5] total 26 [2024-11-09 04:46:37,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416123184] [2024-11-09 04:46:37,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:46:37,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 04:46:37,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:46:37,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 04:46:37,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=516, Unknown=10, NotChecked=0, Total=650 [2024-11-09 04:46:37,802 INFO L87 Difference]: Start difference. First operand 134 states and 155 transitions. Second operand has 15 states, 14 states have (on average 3.0) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 04:46:39,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:46:42,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:46:44,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:46:46,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:46:48,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:46:50,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:46:52,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:46:55,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:46:57,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:46:59,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:47:01,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:47:03,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:47:05,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:47:07,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:47:09,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:47:11,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:47:13,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:47:15,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:47:17,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:47:19,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:47:21,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:47:23,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:47:25,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:47:27,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:47:31,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:47:43,022 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 04:47:45,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:47:47,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:47:49,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:47:51,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:47:53,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:47:55,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:47:57,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:47:59,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:48:01,074 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 04:48:02,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:48:04,167 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 04:48:06,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:48:08,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:48:10,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:48:12,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:48:14,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:48:16,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:48:18,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:48:20,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:48:22,227 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 04:48:24,235 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 04:48:26,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:48:28,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:48:30,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 04:48:33,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-09 04:48:35,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-09 04:48:35,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:48:35,933 INFO L93 Difference]: Finished difference Result 258 states and 301 transitions. [2024-11-09 04:48:35,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 04:48:35,937 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2024-11-09 04:48:35,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:48:35,938 INFO L225 Difference]: With dead ends: 258 [2024-11-09 04:48:35,938 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 04:48:35,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 128 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 29.8s TimeCoverageRelationStatistics Valid=129, Invalid=563, Unknown=10, NotChecked=0, Total=702 [2024-11-09 04:48:35,940 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 7 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 1 mSolverCounterUnsat, 52 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 117.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 52 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 117.8s IncrementalHoareTripleChecker+Time [2024-11-09 04:48:35,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 458 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 412 Invalid, 52 Unknown, 0 Unchecked, 117.8s Time] [2024-11-09 04:48:35,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 04:48:35,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-09 04:48:35,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 120 states have (on average 1.1583333333333334) internal successors, (139), 123 states have internal predecessors, (139), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 04:48:35,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 151 transitions. [2024-11-09 04:48:35,960 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 151 transitions. Word has length 50 [2024-11-09 04:48:35,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:48:35,960 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 151 transitions. [2024-11-09 04:48:35,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 04:48:35,961 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 151 transitions. [2024-11-09 04:48:35,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 04:48:35,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:48:35,962 INFO L215 NwaCegarLoop]: trace histogram [2, 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] [2024-11-09 04:48:35,985 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 04:48:36,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:48:36,163 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 04:48:36,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:48:36,163 INFO L85 PathProgramCache]: Analyzing trace with hash 521343133, now seen corresponding path program 1 times [2024-11-09 04:48:36,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:48:36,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757223242] [2024-11-09 04:48:36,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:48:36,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:48:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:48:37,177 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 04:48:37,177 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:48:37,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757223242] [2024-11-09 04:48:37,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757223242] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:48:37,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594993184] [2024-11-09 04:48:37,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:48:37,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:48:37,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:48:37,180 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:48:37,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 04:48:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:48:37,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 04:48:37,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:48:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 04:48:37,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:48:38,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 04:48:38,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594993184] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:48:38,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [274228934] [2024-11-09 04:48:38,171 INFO L159 IcfgInterpreter]: Started Sifa with 45 locations of interest [2024-11-09 04:48:38,173 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:48:38,173 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:48:38,173 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:48:38,174 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:49:05,355 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 204 for LOIs [2024-11-09 04:49:05,454 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:49:36,958 WARN L286 SmtUtils]: Spent 17.09s on a formula simplification. DAG size of input: 204 DAG size of output: 204 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 04:49:45,978 WARN L286 SmtUtils]: Spent 6.00s 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 04:49:56,737 WARN L286 SmtUtils]: Spent 9.10s 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 04:49:58,756 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~user~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (let ((.cse23 (exists ((|v_#Ultimate.C_memset_#t~loopctr160_27| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr160_27|) (<= 384 (mod |v_#Ultimate.C_memset_#t~loopctr160_27| 4294967296)))))) (or (and (exists ((|v_#memory_$Pointer$.base_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_96| (Array Int (Array Int Int))) (|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#valid_52| (Array Int Int)) (|v_#memory_$Pointer$.base_95| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_17| (Array Int (Array Int Int))) (|v_#length_40| (Array Int Int)) (|v_#memory_$Pointer$.offset_95| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc58#1.base_6| Int) (|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_96| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_321| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_321| (Array Int (Array Int Int))) (|v_#memory_int_362| (Array Int (Array Int Int)))) (let ((.cse8 (select (select |v_#memory_$Pointer$.base_321| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse9 (+ (select (select |v_#memory_$Pointer$.offset_321| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 16)) (.cse13 (select (select |v_#memory_$Pointer$.base_96| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse14 (select (select |v_#memory_$Pointer$.offset_95| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (let ((.cse20 (store |v_#memory_$Pointer$.offset_95| .cse13 (store (select |v_#memory_$Pointer$.offset_95| .cse13) .cse14 0))) (.cse5 (store |v_#memory_$Pointer$.base_96| .cse13 (store (select |v_#memory_$Pointer$.base_96| .cse13) .cse14 |v_ULTIMATE.start_main_#t~malloc58#1.base_6|))) (.cse2 (store |v_#memory_$Pointer$.offset_321| .cse8 (store (select |v_#memory_$Pointer$.offset_321| .cse8) .cse9 8))) (.cse19 (store |v_#memory_$Pointer$.base_321| .cse8 (store (select |v_#memory_$Pointer$.base_321| .cse8) .cse9 |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse21 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_17| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse22 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (let ((.cse1 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_17| .cse21) .cse22)) (.cse10 (select (select |v_#memory_$Pointer$.base_97| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse11 (+ (select (select |v_#memory_$Pointer$.offset_96| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 20)) (.cse3 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse4 (+ (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse7 (+ (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 40)) (.cse0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| .cse21) .cse22)) (.cse17 (select (select |v_#memory_$Pointer$.base_95| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse18 (+ (select (select |v_#memory_$Pointer$.offset_97| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 8))) (and (or (not (= .cse0 0)) (not (= .cse1 0))) (= (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 (select (select |v_#memory_$Pointer$.offset_97| .cse3) .cse4))) |v_#memory_$Pointer$.offset_97|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_17| (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_17| .cse6) .cse7)))) (= (store |v_#memory_int_362| .cse8 (store (select |v_#memory_int_362| .cse8) .cse9 (select (select |v_#memory_int_102| .cse8) .cse9))) |v_#memory_int_102|) (= (store |v_#memory_$Pointer$.offset_96| .cse10 (store (select |v_#memory_$Pointer$.offset_96| .cse10) .cse11 (select (select |v_#memory_$Pointer$.offset_95| .cse10) .cse11))) |v_#memory_$Pointer$.offset_95|) (= (let ((.cse12 (let ((.cse15 (let ((.cse16 (store |v_#memory_int_102| .cse3 (store (select |v_#memory_int_102| .cse3) .cse4 32)))) (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 5))))) (store .cse15 .cse10 (store (select .cse15 .cse10) .cse11 8))))) (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 (select (select |v_#memory_int_103| .cse13) .cse14)))) |v_#memory_int_103|) (<= (+ |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_#t~mem64#1.base| .cse1) (= (store |v_#length_40| |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 384) |c_#length|) (= (store |v_#memory_$Pointer$.base_97| .cse10 (store (select |v_#memory_$Pointer$.base_97| .cse10) .cse11 (select (select |v_#memory_$Pointer$.base_96| .cse10) .cse11))) |v_#memory_$Pointer$.base_96|) (= (store .cse19 .cse3 (store (select .cse19 .cse3) .cse4 (select (select |v_#memory_$Pointer$.base_95| .cse3) .cse4))) |v_#memory_$Pointer$.base_95|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| (store .cse20 .cse6 (store (select .cse20 .cse6) .cse7 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| .cse6) .cse7)))) (not (= |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 0)) (= |c_ULTIMATE.start_main_#t~mem64#1.offset| .cse0) (= (store |v_#memory_$Pointer$.offset_97| .cse17 (store (select |v_#memory_$Pointer$.offset_97| .cse17) .cse18 (select (select |v_#memory_$Pointer$.offset_96| .cse17) .cse18))) |v_#memory_$Pointer$.offset_96|) (= (store |v_#memory_$Pointer$.base_95| .cse17 (store (select |v_#memory_$Pointer$.base_95| .cse17) .cse18 (select (select |v_#memory_$Pointer$.base_97| .cse17) .cse18))) |v_#memory_$Pointer$.base_97|) (= |c_#valid| (store |v_#valid_52| |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 1)) (= (select |v_#valid_52| |v_ULTIMATE.start_main_#t~malloc58#1.base_6|) 0)))))) .cse23) (and (exists ((|v_#memory_$Pointer$.base_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_96| (Array Int (Array Int Int))) (|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#valid_52| (Array Int Int)) (|v_#memory_$Pointer$.base_95| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_18| (Array Int (Array Int Int))) (|v_#length_40| (Array Int Int)) (|v_#memory_$Pointer$.offset_95| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc58#1.base_6| Int) (|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_96| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_321| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_321| (Array Int (Array Int Int))) (|v_#memory_int_362| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| (Array Int (Array Int Int)))) (let ((.cse27 (select (select |v_#memory_$Pointer$.base_321| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse28 (+ (select (select |v_#memory_$Pointer$.offset_321| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 16)) (.cse32 (select (select |v_#memory_$Pointer$.base_96| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse33 (select (select |v_#memory_$Pointer$.offset_95| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (let ((.cse41 (store |v_#memory_$Pointer$.offset_95| .cse32 (store (select |v_#memory_$Pointer$.offset_95| .cse32) .cse33 0))) (.cse44 (store |v_#memory_$Pointer$.base_96| .cse32 (store (select |v_#memory_$Pointer$.base_96| .cse32) .cse33 |v_ULTIMATE.start_main_#t~malloc58#1.base_6|))) (.cse45 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_18| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse46 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse24 (store |v_#memory_$Pointer$.offset_321| .cse27 (store (select |v_#memory_$Pointer$.offset_321| .cse27) .cse28 8))) (.cse40 (store |v_#memory_$Pointer$.base_321| .cse27 (store (select |v_#memory_$Pointer$.base_321| .cse27) .cse28 |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse29 (select (select |v_#memory_$Pointer$.base_97| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse30 (+ (select (select |v_#memory_$Pointer$.offset_96| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 20)) (.cse25 (select (select .cse40 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse26 (+ (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4)) (.cse39 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| .cse45) .cse46)) (.cse38 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_18| .cse45) .cse46)) (.cse42 (select (select .cse44 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse43 (+ (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 40)) (.cse36 (select (select |v_#memory_$Pointer$.base_95| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse37 (+ (select (select |v_#memory_$Pointer$.offset_97| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 8))) (and (= (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 (select (select |v_#memory_$Pointer$.offset_97| .cse25) .cse26))) |v_#memory_$Pointer$.offset_97|) (= (store |v_#memory_int_362| .cse27 (store (select |v_#memory_int_362| .cse27) .cse28 (select (select |v_#memory_int_102| .cse27) .cse28))) |v_#memory_int_102|) (= (store |v_#memory_$Pointer$.offset_96| .cse29 (store (select |v_#memory_$Pointer$.offset_96| .cse29) .cse30 (select (select |v_#memory_$Pointer$.offset_95| .cse29) .cse30))) |v_#memory_$Pointer$.offset_95|) (= (let ((.cse31 (let ((.cse34 (let ((.cse35 (store |v_#memory_int_102| .cse25 (store (select |v_#memory_int_102| .cse25) .cse26 32)))) (store .cse35 .cse36 (store (select .cse35 .cse36) .cse37 5))))) (store .cse34 .cse29 (store (select .cse34 .cse29) .cse30 8))))) (store .cse31 .cse32 (store (select .cse31 .cse32) .cse33 (select (select |v_#memory_int_103| .cse32) .cse33)))) |v_#memory_int_103|) (<= (+ |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 1) |c_#StackHeapBarrier|) (or (not (= .cse38 0)) (not (= .cse39 0))) (= (store |v_#length_40| |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 384) |c_#length|) (= (store |v_#memory_$Pointer$.base_97| .cse29 (store (select |v_#memory_$Pointer$.base_97| .cse29) .cse30 (select (select |v_#memory_$Pointer$.base_96| .cse29) .cse30))) |v_#memory_$Pointer$.base_96|) (= (store .cse40 .cse25 (store (select .cse40 .cse25) .cse26 (select (select |v_#memory_$Pointer$.base_95| .cse25) .cse26))) |v_#memory_$Pointer$.base_95|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| (store .cse41 .cse42 (store (select .cse41 .cse42) .cse43 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| .cse42) .cse43)))) (not (= |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 0)) (= .cse39 |c_ULTIMATE.start_main_#t~mem64#1.offset|) (= .cse38 |c_ULTIMATE.start_main_#t~mem64#1.base|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_18| (store .cse44 .cse42 (store (select .cse44 .cse42) .cse43 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_18| .cse42) .cse43)))) (= (store |v_#memory_$Pointer$.offset_97| .cse36 (store (select |v_#memory_$Pointer$.offset_97| .cse36) .cse37 (select (select |v_#memory_$Pointer$.offset_96| .cse36) .cse37))) |v_#memory_$Pointer$.offset_96|) (= (store |v_#memory_$Pointer$.base_95| .cse36 (store (select |v_#memory_$Pointer$.base_95| .cse36) .cse37 (select (select |v_#memory_$Pointer$.base_97| .cse36) .cse37))) |v_#memory_$Pointer$.base_97|) (= |c_#valid| (store |v_#valid_52| |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 1)) (= (select |v_#valid_52| |v_ULTIMATE.start_main_#t~malloc58#1.base_6|) 0)))))) .cse23)))) is different from false [2024-11-09 04:50:00,775 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~user~0#1.offset| 0) (let ((.cse21 (exists ((|v_#Ultimate.C_memset_#t~loopctr160_27| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr160_27|) (<= 384 (mod |v_#Ultimate.C_memset_#t~loopctr160_27| 4294967296)))))) (or (and (exists ((|v_#memory_$Pointer$.base_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_96| (Array Int (Array Int Int))) (|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#valid_52| (Array Int Int)) (|v_#memory_$Pointer$.base_95| (Array Int (Array Int Int))) (|v_#length_40| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_17| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_95| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc58#1.base_6| Int) (|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_96| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_321| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_321| (Array Int (Array Int Int))) (|v_#memory_int_362| (Array Int (Array Int Int)))) (let ((.cse8 (select (select |v_#memory_$Pointer$.base_321| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse9 (+ (select (select |v_#memory_$Pointer$.offset_321| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 16)) (.cse13 (select (select |v_#memory_$Pointer$.base_96| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse14 (select (select |v_#memory_$Pointer$.offset_95| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (let ((.cse20 (store |v_#memory_$Pointer$.offset_95| .cse13 (store (select |v_#memory_$Pointer$.offset_95| .cse13) .cse14 0))) (.cse5 (store |v_#memory_$Pointer$.base_96| .cse13 (store (select |v_#memory_$Pointer$.base_96| .cse13) .cse14 |v_ULTIMATE.start_main_#t~malloc58#1.base_6|))) (.cse2 (store |v_#memory_$Pointer$.offset_321| .cse8 (store (select |v_#memory_$Pointer$.offset_321| .cse8) .cse9 8))) (.cse19 (store |v_#memory_$Pointer$.base_321| .cse8 (store (select |v_#memory_$Pointer$.base_321| .cse8) .cse9 |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse10 (select (select |v_#memory_$Pointer$.base_97| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse11 (+ (select (select |v_#memory_$Pointer$.offset_96| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 20)) (.cse3 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse4 (+ (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse7 (+ (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 40)) (.cse17 (select (select |v_#memory_$Pointer$.base_95| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse18 (+ (select (select |v_#memory_$Pointer$.offset_97| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 8))) (and (let ((.cse0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_17| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse1 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (or (not (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| .cse0) .cse1) 0)) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_17| .cse0) .cse1) 0)))) (= (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 (select (select |v_#memory_$Pointer$.offset_97| .cse3) .cse4))) |v_#memory_$Pointer$.offset_97|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_17| (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_17| .cse6) .cse7)))) (= (store |v_#memory_int_362| .cse8 (store (select |v_#memory_int_362| .cse8) .cse9 (select (select |v_#memory_int_102| .cse8) .cse9))) |v_#memory_int_102|) (= (store |v_#memory_$Pointer$.offset_96| .cse10 (store (select |v_#memory_$Pointer$.offset_96| .cse10) .cse11 (select (select |v_#memory_$Pointer$.offset_95| .cse10) .cse11))) |v_#memory_$Pointer$.offset_95|) (= (let ((.cse12 (let ((.cse15 (let ((.cse16 (store |v_#memory_int_102| .cse3 (store (select |v_#memory_int_102| .cse3) .cse4 32)))) (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 5))))) (store .cse15 .cse10 (store (select .cse15 .cse10) .cse11 8))))) (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 (select (select |v_#memory_int_103| .cse13) .cse14)))) |v_#memory_int_103|) (<= (+ |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 1) |c_#StackHeapBarrier|) (= (store |v_#length_40| |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 384) |c_#length|) (= (store |v_#memory_$Pointer$.base_97| .cse10 (store (select |v_#memory_$Pointer$.base_97| .cse10) .cse11 (select (select |v_#memory_$Pointer$.base_96| .cse10) .cse11))) |v_#memory_$Pointer$.base_96|) (= (store .cse19 .cse3 (store (select .cse19 .cse3) .cse4 (select (select |v_#memory_$Pointer$.base_95| .cse3) .cse4))) |v_#memory_$Pointer$.base_95|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| (store .cse20 .cse6 (store (select .cse20 .cse6) .cse7 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| .cse6) .cse7)))) (not (= |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 0)) (= (store |v_#memory_$Pointer$.offset_97| .cse17 (store (select |v_#memory_$Pointer$.offset_97| .cse17) .cse18 (select (select |v_#memory_$Pointer$.offset_96| .cse17) .cse18))) |v_#memory_$Pointer$.offset_96|) (= (store |v_#memory_$Pointer$.base_95| .cse17 (store (select |v_#memory_$Pointer$.base_95| .cse17) .cse18 (select (select |v_#memory_$Pointer$.base_97| .cse17) .cse18))) |v_#memory_$Pointer$.base_97|) (= |c_#valid| (store |v_#valid_52| |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 1)) (= (select |v_#valid_52| |v_ULTIMATE.start_main_#t~malloc58#1.base_6|) 0)))))) .cse21) (and (exists ((|v_#memory_$Pointer$.base_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_96| (Array Int (Array Int Int))) (|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#valid_52| (Array Int Int)) (|v_#memory_$Pointer$.base_95| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_18| (Array Int (Array Int Int))) (|v_#length_40| (Array Int Int)) (|v_#memory_$Pointer$.offset_95| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc58#1.base_6| Int) (|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_96| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_321| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_321| (Array Int (Array Int Int))) (|v_#memory_int_362| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| (Array Int (Array Int Int)))) (let ((.cse25 (select (select |v_#memory_$Pointer$.base_321| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse26 (+ (select (select |v_#memory_$Pointer$.offset_321| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 16)) (.cse30 (select (select |v_#memory_$Pointer$.base_96| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse31 (select (select |v_#memory_$Pointer$.offset_95| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (let ((.cse39 (store |v_#memory_$Pointer$.offset_95| .cse30 (store (select |v_#memory_$Pointer$.offset_95| .cse30) .cse31 0))) (.cse42 (store |v_#memory_$Pointer$.base_96| .cse30 (store (select |v_#memory_$Pointer$.base_96| .cse30) .cse31 |v_ULTIMATE.start_main_#t~malloc58#1.base_6|))) (.cse22 (store |v_#memory_$Pointer$.offset_321| .cse25 (store (select |v_#memory_$Pointer$.offset_321| .cse25) .cse26 8))) (.cse38 (store |v_#memory_$Pointer$.base_321| .cse25 (store (select |v_#memory_$Pointer$.base_321| .cse25) .cse26 |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse27 (select (select |v_#memory_$Pointer$.base_97| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse28 (+ (select (select |v_#memory_$Pointer$.offset_96| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 20)) (.cse23 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse24 (+ (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4)) (.cse40 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse41 (+ (select (select .cse39 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 40)) (.cse34 (select (select |v_#memory_$Pointer$.base_95| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse35 (+ (select (select |v_#memory_$Pointer$.offset_97| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 8))) (and (= (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 (select (select |v_#memory_$Pointer$.offset_97| .cse23) .cse24))) |v_#memory_$Pointer$.offset_97|) (= (store |v_#memory_int_362| .cse25 (store (select |v_#memory_int_362| .cse25) .cse26 (select (select |v_#memory_int_102| .cse25) .cse26))) |v_#memory_int_102|) (= (store |v_#memory_$Pointer$.offset_96| .cse27 (store (select |v_#memory_$Pointer$.offset_96| .cse27) .cse28 (select (select |v_#memory_$Pointer$.offset_95| .cse27) .cse28))) |v_#memory_$Pointer$.offset_95|) (= (let ((.cse29 (let ((.cse32 (let ((.cse33 (store |v_#memory_int_102| .cse23 (store (select |v_#memory_int_102| .cse23) .cse24 32)))) (store .cse33 .cse34 (store (select .cse33 .cse34) .cse35 5))))) (store .cse32 .cse27 (store (select .cse32 .cse27) .cse28 8))))) (store .cse29 .cse30 (store (select .cse29 .cse30) .cse31 (select (select |v_#memory_int_103| .cse30) .cse31)))) |v_#memory_int_103|) (<= (+ |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 1) |c_#StackHeapBarrier|) (let ((.cse36 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_18| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse37 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (or (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_18| .cse36) .cse37) 0)) (not (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| .cse36) .cse37) 0)))) (= (store |v_#length_40| |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 384) |c_#length|) (= (store |v_#memory_$Pointer$.base_97| .cse27 (store (select |v_#memory_$Pointer$.base_97| .cse27) .cse28 (select (select |v_#memory_$Pointer$.base_96| .cse27) .cse28))) |v_#memory_$Pointer$.base_96|) (= (store .cse38 .cse23 (store (select .cse38 .cse23) .cse24 (select (select |v_#memory_$Pointer$.base_95| .cse23) .cse24))) |v_#memory_$Pointer$.base_95|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| (store .cse39 .cse40 (store (select .cse39 .cse40) .cse41 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| .cse40) .cse41)))) (not (= |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 0)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_18| (store .cse42 .cse40 (store (select .cse42 .cse40) .cse41 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_18| .cse40) .cse41)))) (= (store |v_#memory_$Pointer$.offset_97| .cse34 (store (select |v_#memory_$Pointer$.offset_97| .cse34) .cse35 (select (select |v_#memory_$Pointer$.offset_96| .cse34) .cse35))) |v_#memory_$Pointer$.offset_96|) (= (store |v_#memory_$Pointer$.base_95| .cse34 (store (select |v_#memory_$Pointer$.base_95| .cse34) .cse35 (select (select |v_#memory_$Pointer$.base_97| .cse34) .cse35))) |v_#memory_$Pointer$.base_97|) (= |c_#valid| (store |v_#valid_52| |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 1)) (= (select |v_#valid_52| |v_ULTIMATE.start_main_#t~malloc58#1.base_6|) 0)))))) .cse21))) (<= 1 |c_#StackHeapBarrier|) (<= 0 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2024-11-09 04:50:02,796 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~user~0#1.offset| 0) (= |c_ULTIMATE.start_main_~users~0#1.offset| 0) (let ((.cse21 (exists ((|v_#Ultimate.C_memset_#t~loopctr160_27| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr160_27|) (<= 384 (mod |v_#Ultimate.C_memset_#t~loopctr160_27| 4294967296)))))) (or (and (exists ((|v_#memory_$Pointer$.base_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_96| (Array Int (Array Int Int))) (|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#valid_52| (Array Int Int)) (|v_#memory_$Pointer$.base_95| (Array Int (Array Int Int))) (|v_#length_40| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_17| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_95| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc58#1.base_6| Int) (|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_96| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_321| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_321| (Array Int (Array Int Int))) (|v_#memory_int_362| (Array Int (Array Int Int)))) (let ((.cse8 (select (select |v_#memory_$Pointer$.base_321| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse9 (+ (select (select |v_#memory_$Pointer$.offset_321| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 16)) (.cse13 (select (select |v_#memory_$Pointer$.base_96| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse14 (select (select |v_#memory_$Pointer$.offset_95| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (let ((.cse20 (store |v_#memory_$Pointer$.offset_95| .cse13 (store (select |v_#memory_$Pointer$.offset_95| .cse13) .cse14 0))) (.cse5 (store |v_#memory_$Pointer$.base_96| .cse13 (store (select |v_#memory_$Pointer$.base_96| .cse13) .cse14 |v_ULTIMATE.start_main_#t~malloc58#1.base_6|))) (.cse2 (store |v_#memory_$Pointer$.offset_321| .cse8 (store (select |v_#memory_$Pointer$.offset_321| .cse8) .cse9 8))) (.cse19 (store |v_#memory_$Pointer$.base_321| .cse8 (store (select |v_#memory_$Pointer$.base_321| .cse8) .cse9 |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse10 (select (select |v_#memory_$Pointer$.base_97| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse11 (+ (select (select |v_#memory_$Pointer$.offset_96| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 20)) (.cse3 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse4 (+ (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse7 (+ (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 40)) (.cse17 (select (select |v_#memory_$Pointer$.base_95| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse18 (+ (select (select |v_#memory_$Pointer$.offset_97| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 8))) (and (let ((.cse0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_17| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse1 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (or (not (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| .cse0) .cse1) 0)) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_17| .cse0) .cse1) 0)))) (= (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 (select (select |v_#memory_$Pointer$.offset_97| .cse3) .cse4))) |v_#memory_$Pointer$.offset_97|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_17| (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_17| .cse6) .cse7)))) (= (store |v_#memory_int_362| .cse8 (store (select |v_#memory_int_362| .cse8) .cse9 (select (select |v_#memory_int_102| .cse8) .cse9))) |v_#memory_int_102|) (= (store |v_#memory_$Pointer$.offset_96| .cse10 (store (select |v_#memory_$Pointer$.offset_96| .cse10) .cse11 (select (select |v_#memory_$Pointer$.offset_95| .cse10) .cse11))) |v_#memory_$Pointer$.offset_95|) (= (let ((.cse12 (let ((.cse15 (let ((.cse16 (store |v_#memory_int_102| .cse3 (store (select |v_#memory_int_102| .cse3) .cse4 32)))) (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 5))))) (store .cse15 .cse10 (store (select .cse15 .cse10) .cse11 8))))) (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 (select (select |v_#memory_int_103| .cse13) .cse14)))) |v_#memory_int_103|) (<= (+ |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 1) |c_#StackHeapBarrier|) (= (store |v_#length_40| |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 384) |c_#length|) (= (store |v_#memory_$Pointer$.base_97| .cse10 (store (select |v_#memory_$Pointer$.base_97| .cse10) .cse11 (select (select |v_#memory_$Pointer$.base_96| .cse10) .cse11))) |v_#memory_$Pointer$.base_96|) (= (store .cse19 .cse3 (store (select .cse19 .cse3) .cse4 (select (select |v_#memory_$Pointer$.base_95| .cse3) .cse4))) |v_#memory_$Pointer$.base_95|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| (store .cse20 .cse6 (store (select .cse20 .cse6) .cse7 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| .cse6) .cse7)))) (not (= |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 0)) (= (store |v_#memory_$Pointer$.offset_97| .cse17 (store (select |v_#memory_$Pointer$.offset_97| .cse17) .cse18 (select (select |v_#memory_$Pointer$.offset_96| .cse17) .cse18))) |v_#memory_$Pointer$.offset_96|) (= (store |v_#memory_$Pointer$.base_95| .cse17 (store (select |v_#memory_$Pointer$.base_95| .cse17) .cse18 (select (select |v_#memory_$Pointer$.base_97| .cse17) .cse18))) |v_#memory_$Pointer$.base_97|) (= |c_#valid| (store |v_#valid_52| |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 1)) (= (select |v_#valid_52| |v_ULTIMATE.start_main_#t~malloc58#1.base_6|) 0)))))) .cse21) (and (exists ((|v_#memory_$Pointer$.base_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_96| (Array Int (Array Int Int))) (|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#valid_52| (Array Int Int)) (|v_#memory_$Pointer$.base_95| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_18| (Array Int (Array Int Int))) (|v_#length_40| (Array Int Int)) (|v_#memory_$Pointer$.offset_95| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc58#1.base_6| Int) (|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_96| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_321| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_321| (Array Int (Array Int Int))) (|v_#memory_int_362| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| (Array Int (Array Int Int)))) (let ((.cse25 (select (select |v_#memory_$Pointer$.base_321| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse26 (+ (select (select |v_#memory_$Pointer$.offset_321| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 16)) (.cse30 (select (select |v_#memory_$Pointer$.base_96| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse31 (select (select |v_#memory_$Pointer$.offset_95| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (let ((.cse39 (store |v_#memory_$Pointer$.offset_95| .cse30 (store (select |v_#memory_$Pointer$.offset_95| .cse30) .cse31 0))) (.cse42 (store |v_#memory_$Pointer$.base_96| .cse30 (store (select |v_#memory_$Pointer$.base_96| .cse30) .cse31 |v_ULTIMATE.start_main_#t~malloc58#1.base_6|))) (.cse22 (store |v_#memory_$Pointer$.offset_321| .cse25 (store (select |v_#memory_$Pointer$.offset_321| .cse25) .cse26 8))) (.cse38 (store |v_#memory_$Pointer$.base_321| .cse25 (store (select |v_#memory_$Pointer$.base_321| .cse25) .cse26 |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse27 (select (select |v_#memory_$Pointer$.base_97| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse28 (+ (select (select |v_#memory_$Pointer$.offset_96| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 20)) (.cse23 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse24 (+ (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4)) (.cse40 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse41 (+ (select (select .cse39 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 40)) (.cse34 (select (select |v_#memory_$Pointer$.base_95| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse35 (+ (select (select |v_#memory_$Pointer$.offset_97| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 8))) (and (= (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 (select (select |v_#memory_$Pointer$.offset_97| .cse23) .cse24))) |v_#memory_$Pointer$.offset_97|) (= (store |v_#memory_int_362| .cse25 (store (select |v_#memory_int_362| .cse25) .cse26 (select (select |v_#memory_int_102| .cse25) .cse26))) |v_#memory_int_102|) (= (store |v_#memory_$Pointer$.offset_96| .cse27 (store (select |v_#memory_$Pointer$.offset_96| .cse27) .cse28 (select (select |v_#memory_$Pointer$.offset_95| .cse27) .cse28))) |v_#memory_$Pointer$.offset_95|) (= (let ((.cse29 (let ((.cse32 (let ((.cse33 (store |v_#memory_int_102| .cse23 (store (select |v_#memory_int_102| .cse23) .cse24 32)))) (store .cse33 .cse34 (store (select .cse33 .cse34) .cse35 5))))) (store .cse32 .cse27 (store (select .cse32 .cse27) .cse28 8))))) (store .cse29 .cse30 (store (select .cse29 .cse30) .cse31 (select (select |v_#memory_int_103| .cse30) .cse31)))) |v_#memory_int_103|) (<= (+ |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 1) |c_#StackHeapBarrier|) (let ((.cse36 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_18| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse37 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (or (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_18| .cse36) .cse37) 0)) (not (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| .cse36) .cse37) 0)))) (= (store |v_#length_40| |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 384) |c_#length|) (= (store |v_#memory_$Pointer$.base_97| .cse27 (store (select |v_#memory_$Pointer$.base_97| .cse27) .cse28 (select (select |v_#memory_$Pointer$.base_96| .cse27) .cse28))) |v_#memory_$Pointer$.base_96|) (= (store .cse38 .cse23 (store (select .cse38 .cse23) .cse24 (select (select |v_#memory_$Pointer$.base_95| .cse23) .cse24))) |v_#memory_$Pointer$.base_95|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| (store .cse39 .cse40 (store (select .cse39 .cse40) .cse41 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| .cse40) .cse41)))) (not (= |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 0)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_18| (store .cse42 .cse40 (store (select .cse42 .cse40) .cse41 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_18| .cse40) .cse41)))) (= (store |v_#memory_$Pointer$.offset_97| .cse34 (store (select |v_#memory_$Pointer$.offset_97| .cse34) .cse35 (select (select |v_#memory_$Pointer$.offset_96| .cse34) .cse35))) |v_#memory_$Pointer$.offset_96|) (= (store |v_#memory_$Pointer$.base_95| .cse34 (store (select |v_#memory_$Pointer$.base_95| .cse34) .cse35 (select (select |v_#memory_$Pointer$.base_97| .cse34) .cse35))) |v_#memory_$Pointer$.base_97|) (= |c_#valid| (store |v_#valid_52| |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 1)) (= (select |v_#valid_52| |v_ULTIMATE.start_main_#t~malloc58#1.base_6|) 0)))))) .cse21))) (<= 1 |c_#StackHeapBarrier|) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~users~0#1.base| |c_ULTIMATE.start_main_~user~0#1.base|)) is different from false [2024-11-09 04:50:04,813 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#memory_int_363| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_322| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_322| (Array Int (Array Int Int)))) (let ((.cse1 (+ (select (select |v_#memory_$Pointer$.offset_322| |c_ULTIMATE.start_main_~users~0#1.base|) 8) 12)) (.cse0 (select (select |v_#memory_$Pointer$.base_322| |c_ULTIMATE.start_main_~users~0#1.base|) 8))) (and (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_322| .cse0 (store (select |v_#memory_$Pointer$.base_322| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)))) (= (store |v_#memory_$Pointer$.offset_322| .cse0 (store (select |v_#memory_$Pointer$.offset_322| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) |c_#memory_$Pointer$.offset|) (= (store |v_#memory_int_363| .cse0 (let ((.cse2 (select |v_#memory_int_363| .cse0))) (store .cse2 .cse1 (+ (select .cse2 .cse1) 1)))) |c_#memory_int|)))) (= |c_ULTIMATE.start_main_~user~0#1.offset| 0) (= |c_ULTIMATE.start_main_~users~0#1.offset| 0) (let ((.cse24 (exists ((|v_#Ultimate.C_memset_#t~loopctr160_27| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr160_27|) (<= 384 (mod |v_#Ultimate.C_memset_#t~loopctr160_27| 4294967296)))))) (or (and (exists ((|v_#memory_$Pointer$.base_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_96| (Array Int (Array Int Int))) (|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#valid_52| (Array Int Int)) (|v_#memory_$Pointer$.base_95| (Array Int (Array Int Int))) (|v_#length_40| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_17| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_95| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc58#1.base_6| Int) (|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_96| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_321| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_321| (Array Int (Array Int Int))) (|v_#memory_int_362| (Array Int (Array Int Int)))) (let ((.cse11 (select (select |v_#memory_$Pointer$.base_321| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse12 (+ (select (select |v_#memory_$Pointer$.offset_321| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 16)) (.cse16 (select (select |v_#memory_$Pointer$.base_96| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse17 (select (select |v_#memory_$Pointer$.offset_95| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (let ((.cse23 (store |v_#memory_$Pointer$.offset_95| .cse16 (store (select |v_#memory_$Pointer$.offset_95| .cse16) .cse17 0))) (.cse8 (store |v_#memory_$Pointer$.base_96| .cse16 (store (select |v_#memory_$Pointer$.base_96| .cse16) .cse17 |v_ULTIMATE.start_main_#t~malloc58#1.base_6|))) (.cse5 (store |v_#memory_$Pointer$.offset_321| .cse11 (store (select |v_#memory_$Pointer$.offset_321| .cse11) .cse12 8))) (.cse22 (store |v_#memory_$Pointer$.base_321| .cse11 (store (select |v_#memory_$Pointer$.base_321| .cse11) .cse12 |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse13 (select (select |v_#memory_$Pointer$.base_97| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse14 (+ (select (select |v_#memory_$Pointer$.offset_96| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 20)) (.cse6 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse7 (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4)) (.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse10 (+ (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 40)) (.cse20 (select (select |v_#memory_$Pointer$.base_95| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse21 (+ (select (select |v_#memory_$Pointer$.offset_97| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 8))) (and (let ((.cse3 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_17| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse4 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (or (not (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| .cse3) .cse4) 0)) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_17| .cse3) .cse4) 0)))) (= (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 (select (select |v_#memory_$Pointer$.offset_97| .cse6) .cse7))) |v_#memory_$Pointer$.offset_97|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_17| (store .cse8 .cse9 (store (select .cse8 .cse9) .cse10 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_17| .cse9) .cse10)))) (= (store |v_#memory_int_362| .cse11 (store (select |v_#memory_int_362| .cse11) .cse12 (select (select |v_#memory_int_102| .cse11) .cse12))) |v_#memory_int_102|) (= (store |v_#memory_$Pointer$.offset_96| .cse13 (store (select |v_#memory_$Pointer$.offset_96| .cse13) .cse14 (select (select |v_#memory_$Pointer$.offset_95| .cse13) .cse14))) |v_#memory_$Pointer$.offset_95|) (= (let ((.cse15 (let ((.cse18 (let ((.cse19 (store |v_#memory_int_102| .cse6 (store (select |v_#memory_int_102| .cse6) .cse7 32)))) (store .cse19 .cse20 (store (select .cse19 .cse20) .cse21 5))))) (store .cse18 .cse13 (store (select .cse18 .cse13) .cse14 8))))) (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 (select (select |v_#memory_int_103| .cse16) .cse17)))) |v_#memory_int_103|) (<= (+ |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 1) |c_#StackHeapBarrier|) (= (store |v_#length_40| |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 384) |c_#length|) (= (store |v_#memory_$Pointer$.base_97| .cse13 (store (select |v_#memory_$Pointer$.base_97| .cse13) .cse14 (select (select |v_#memory_$Pointer$.base_96| .cse13) .cse14))) |v_#memory_$Pointer$.base_96|) (= (store .cse22 .cse6 (store (select .cse22 .cse6) .cse7 (select (select |v_#memory_$Pointer$.base_95| .cse6) .cse7))) |v_#memory_$Pointer$.base_95|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| (store .cse23 .cse9 (store (select .cse23 .cse9) .cse10 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| .cse9) .cse10)))) (not (= |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 0)) (= (store |v_#memory_$Pointer$.offset_97| .cse20 (store (select |v_#memory_$Pointer$.offset_97| .cse20) .cse21 (select (select |v_#memory_$Pointer$.offset_96| .cse20) .cse21))) |v_#memory_$Pointer$.offset_96|) (= (store |v_#memory_$Pointer$.base_95| .cse20 (store (select |v_#memory_$Pointer$.base_95| .cse20) .cse21 (select (select |v_#memory_$Pointer$.base_97| .cse20) .cse21))) |v_#memory_$Pointer$.base_97|) (= |c_#valid| (store |v_#valid_52| |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 1)) (= (select |v_#valid_52| |v_ULTIMATE.start_main_#t~malloc58#1.base_6|) 0)))))) .cse24) (and (exists ((|v_#memory_$Pointer$.base_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_96| (Array Int (Array Int Int))) (|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#valid_52| (Array Int Int)) (|v_#memory_$Pointer$.base_95| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_18| (Array Int (Array Int Int))) (|v_#length_40| (Array Int Int)) (|v_#memory_$Pointer$.offset_95| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc58#1.base_6| Int) (|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_96| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_321| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_321| (Array Int (Array Int Int))) (|v_#memory_int_362| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| (Array Int (Array Int Int)))) (let ((.cse28 (select (select |v_#memory_$Pointer$.base_321| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse29 (+ (select (select |v_#memory_$Pointer$.offset_321| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 16)) (.cse33 (select (select |v_#memory_$Pointer$.base_96| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse34 (select (select |v_#memory_$Pointer$.offset_95| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (let ((.cse42 (store |v_#memory_$Pointer$.offset_95| .cse33 (store (select |v_#memory_$Pointer$.offset_95| .cse33) .cse34 0))) (.cse45 (store |v_#memory_$Pointer$.base_96| .cse33 (store (select |v_#memory_$Pointer$.base_96| .cse33) .cse34 |v_ULTIMATE.start_main_#t~malloc58#1.base_6|))) (.cse25 (store |v_#memory_$Pointer$.offset_321| .cse28 (store (select |v_#memory_$Pointer$.offset_321| .cse28) .cse29 8))) (.cse41 (store |v_#memory_$Pointer$.base_321| .cse28 (store (select |v_#memory_$Pointer$.base_321| .cse28) .cse29 |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse30 (select (select |v_#memory_$Pointer$.base_97| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse31 (+ (select (select |v_#memory_$Pointer$.offset_96| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 20)) (.cse26 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse27 (+ (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4)) (.cse43 (select (select .cse45 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse44 (+ (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 40)) (.cse37 (select (select |v_#memory_$Pointer$.base_95| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse38 (+ (select (select |v_#memory_$Pointer$.offset_97| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 8))) (and (= (store .cse25 .cse26 (store (select .cse25 .cse26) .cse27 (select (select |v_#memory_$Pointer$.offset_97| .cse26) .cse27))) |v_#memory_$Pointer$.offset_97|) (= (store |v_#memory_int_362| .cse28 (store (select |v_#memory_int_362| .cse28) .cse29 (select (select |v_#memory_int_102| .cse28) .cse29))) |v_#memory_int_102|) (= (store |v_#memory_$Pointer$.offset_96| .cse30 (store (select |v_#memory_$Pointer$.offset_96| .cse30) .cse31 (select (select |v_#memory_$Pointer$.offset_95| .cse30) .cse31))) |v_#memory_$Pointer$.offset_95|) (= (let ((.cse32 (let ((.cse35 (let ((.cse36 (store |v_#memory_int_102| .cse26 (store (select |v_#memory_int_102| .cse26) .cse27 32)))) (store .cse36 .cse37 (store (select .cse36 .cse37) .cse38 5))))) (store .cse35 .cse30 (store (select .cse35 .cse30) .cse31 8))))) (store .cse32 .cse33 (store (select .cse32 .cse33) .cse34 (select (select |v_#memory_int_103| .cse33) .cse34)))) |v_#memory_int_103|) (<= (+ |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 1) |c_#StackHeapBarrier|) (let ((.cse39 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_18| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse40 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (or (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_18| .cse39) .cse40) 0)) (not (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| .cse39) .cse40) 0)))) (= (store |v_#length_40| |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 384) |c_#length|) (= (store |v_#memory_$Pointer$.base_97| .cse30 (store (select |v_#memory_$Pointer$.base_97| .cse30) .cse31 (select (select |v_#memory_$Pointer$.base_96| .cse30) .cse31))) |v_#memory_$Pointer$.base_96|) (= (store .cse41 .cse26 (store (select .cse41 .cse26) .cse27 (select (select |v_#memory_$Pointer$.base_95| .cse26) .cse27))) |v_#memory_$Pointer$.base_95|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| (store .cse42 .cse43 (store (select .cse42 .cse43) .cse44 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| .cse43) .cse44)))) (not (= |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 0)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_18| (store .cse45 .cse43 (store (select .cse45 .cse43) .cse44 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_18| .cse43) .cse44)))) (= (store |v_#memory_$Pointer$.offset_97| .cse37 (store (select |v_#memory_$Pointer$.offset_97| .cse37) .cse38 (select (select |v_#memory_$Pointer$.offset_96| .cse37) .cse38))) |v_#memory_$Pointer$.offset_96|) (= (store |v_#memory_$Pointer$.base_95| .cse37 (store (select |v_#memory_$Pointer$.base_95| .cse37) .cse38 (select (select |v_#memory_$Pointer$.base_97| .cse37) .cse38))) |v_#memory_$Pointer$.base_97|) (= |c_#valid| (store |v_#valid_52| |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 1)) (= (select |v_#valid_52| |v_ULTIMATE.start_main_#t~malloc58#1.base_6|) 0)))))) .cse24))) (<= 1 |c_#StackHeapBarrier|) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~users~0#1.base| |c_ULTIMATE.start_main_~user~0#1.base|)) is different from false [2024-11-09 04:52:43,158 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 04:52:45,917 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3051#(exists ((|v_ULTIMATE.start_main_#t~mem6#1_31| Int) (|v_ULTIMATE.start_main_~sum~0#1_39| Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~user~0#1.base|) 4) 32767) (exists ((|v_#memory_$Pointer$.offset_324| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_100| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_100| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_100| |ULTIMATE.start_main_~user~0#1.base|) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~user~0#1.base|) 4)))) (= (store |v_#memory_$Pointer$.offset_324| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_324| |ULTIMATE.start_main_~user~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_100| |ULTIMATE.start_main_~user~0#1.base|) 0))) |v_#memory_$Pointer$.offset_100|))) (<= (+ |ULTIMATE.start_main_~user~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_53| (Array Int Int)) (|v_#length_41| (Array Int Int)) (|v_#memory_int_365| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~user~0#1.offset_92| Int)) (and (= (store |v_#length_41| |ULTIMATE.start_main_~user~0#1.base| 40) |#length|) (<= 1 |#StackHeapBarrier|) (= (select |v_#valid_53| |ULTIMATE.start_main_~user~0#1.base|) 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |v_ULTIMATE.start_main_~user~0#1.offset_92| 0) (= (store |v_#valid_53| |ULTIMATE.start_main_~user~0#1.base| 1) |#valid|) (= (store |v_#memory_int_365| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_365| |ULTIMATE.start_main_~user~0#1.base|) 0 |ULTIMATE.start_main_~i~0#1|) 4 (select (select |#memory_int| |ULTIMATE.start_main_~user~0#1.base|) 4))) |#memory_int|))) (not (= |ULTIMATE.start_main_~user~0#1.base| 0)) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~user~0#1.base|) 4) 32768)) (exists ((|v_#memory_$Pointer$.base_324| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_100| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.base_100| (store |v_#memory_$Pointer$.base_324| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_324| |ULTIMATE.start_main_~user~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_100| |ULTIMATE.start_main_~user~0#1.base|) 0)))) (= (store |v_#memory_$Pointer$.base_100| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_100| |ULTIMATE.start_main_~user~0#1.base|) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) 4))) |#memory_$Pointer$.base|))) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (<= (+ 2147483649 |v_ULTIMATE.start_main_#t~mem6#1_31| |v_ULTIMATE.start_main_~sum~0#1_39|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~user~0#1.base|) 4) |v_ULTIMATE.start_main_#t~mem6#1_31|) (<= |ULTIMATE.start_main_~i~0#1| 9)))' at error location [2024-11-09 04:52:45,917 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:52:45,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:52:45,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-09 04:52:45,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720533525] [2024-11-09 04:52:45,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:52:45,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 04:52:45,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:52:45,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 04:52:45,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1096, Unknown=32, NotChecked=284, Total=1560 [2024-11-09 04:52:45,920 INFO L87 Difference]: Start difference. First operand 132 states and 151 transitions. Second operand has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 04:52:47,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:52:49,640 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 04:52:50,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:52:53,411 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 04:52:57,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:52:59,308 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 04:53:01,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:53:03,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-09 04:53:05,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-09 04:53:08,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-09 04:53:11,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-09 04:53:11,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:53:11,888 INFO L93 Difference]: Finished difference Result 276 states and 332 transitions. [2024-11-09 04:53:11,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 04:53:11,889 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 51 [2024-11-09 04:53:11,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:53:11,891 INFO L225 Difference]: With dead ends: 276 [2024-11-09 04:53:11,891 INFO L226 Difference]: Without dead ends: 275 [2024-11-09 04:53:11,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 222.8s TimeCoverageRelationStatistics Valid=165, Invalid=1224, Unknown=33, NotChecked=300, Total=1722 [2024-11-09 04:53:11,893 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 155 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:53:11,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 453 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 6 Unknown, 0 Unchecked, 23.7s Time] [2024-11-09 04:53:11,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-09 04:53:11,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 257. [2024-11-09 04:53:11,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 239 states have (on average 1.1799163179916319) internal successors, (282), 242 states have internal predecessors, (282), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:53:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 306 transitions. [2024-11-09 04:53:11,918 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 306 transitions. Word has length 51 [2024-11-09 04:53:11,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:53:11,918 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 306 transitions. [2024-11-09 04:53:11,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 04:53:11,919 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 306 transitions. [2024-11-09 04:53:11,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 04:53:11,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:53:11,920 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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] [2024-11-09 04:53:11,941 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 04:53:12,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:53:12,121 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 04:53:12,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:53:12,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1018232001, now seen corresponding path program 1 times [2024-11-09 04:53:12,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:53:12,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513746919] [2024-11-09 04:53:12,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:53:12,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:53:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:53:12,920 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 04:53:12,920 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:53:12,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513746919] [2024-11-09 04:53:12,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513746919] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:53:12,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598646644] [2024-11-09 04:53:12,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:53:12,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:53:12,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:53:12,923 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:53:12,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05b6c6a-9ef4-4d84-b0be-c8358444b01b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 04:53:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:53:13,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 04:53:13,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:53:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 04:53:13,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:53:13,862 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 04:53:13,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598646644] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:53:13,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2044003357] [2024-11-09 04:53:13,865 INFO L159 IcfgInterpreter]: Started Sifa with 45 locations of interest [2024-11-09 04:53:13,865 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:53:13,866 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:53:13,866 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:53:13,866 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:53:45,928 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 390 for LOIs [2024-11-09 04:53:50,321 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:55:19,183 WARN L286 SmtUtils]: Spent 32.74s on a formula simplification. DAG size of input: 390 DAG size of output: 379 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 04:55:34,627 WARN L286 SmtUtils]: Spent 5.44s on a formula simplification that was a NOOP. DAG size: 182 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 04:55:44,536 WARN L286 SmtUtils]: Spent 6.22s on a formula simplification that was a NOOP. DAG size: 187 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 04:56:58,673 WARN L286 SmtUtils]: Spent 28.99s on a formula simplification that was a NOOP. DAG size: 220 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 04:57:00,690 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse0 (exists ((|v_#Ultimate.C_memset_#t~loopctr160_41| Int)) (and (<= 384 (mod |v_#Ultimate.C_memset_#t~loopctr160_41| 4294967296)) (<= 0 |v_#Ultimate.C_memset_#t~loopctr160_41|))))) (or (and .cse0 (exists ((|v_#memory_$Pointer$.base_97| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_31| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_96| (Array Int (Array Int Int))) (|v_#valid_67| (Array Int Int)) (|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#memory_int_422| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_95| (Array Int (Array Int Int))) (|v_#length_55| (Array Int Int)) (|v_#memory_$Pointer$.offset_95| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc58#1.base_6| Int) (|v_#memory_$Pointer$.base_381| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_96| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_381| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_31| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int)))) (let ((.cse14 (select (select |v_#memory_$Pointer$.base_96| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse15 (select (select |v_#memory_$Pointer$.offset_95| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse20 (select (select |v_#memory_$Pointer$.base_381| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse21 (+ (select (select |v_#memory_$Pointer$.offset_381| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 16))) (let ((.cse12 (store |v_#memory_$Pointer$.offset_381| .cse20 (store (select |v_#memory_$Pointer$.offset_381| .cse20) .cse21 8))) (.cse5 (store |v_#memory_$Pointer$.base_381| .cse20 (store (select |v_#memory_$Pointer$.base_381| .cse20) .cse21 |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse8 (store |v_#memory_$Pointer$.offset_95| .cse14 (store (select |v_#memory_$Pointer$.offset_95| .cse14) .cse15 0))) (.cse11 (store |v_#memory_$Pointer$.base_96| .cse14 (store (select |v_#memory_$Pointer$.base_96| .cse14) .cse15 |v_ULTIMATE.start_main_#t~malloc58#1.base_6|)))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse10 (+ (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 40)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse7 (+ (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4)) (.cse3 (select (select |v_#memory_$Pointer$.base_97| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse4 (+ (select (select |v_#memory_$Pointer$.offset_96| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 20)) (.cse18 (select (select |v_#memory_$Pointer$.base_95| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse19 (+ (select (select |v_#memory_$Pointer$.offset_97| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 8))) (and (let ((.cse1 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_31| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse2 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_31| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (or (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_31| .cse1) .cse2) 0)) (not (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_31| .cse1) .cse2) 0)))) (= (store |v_#memory_$Pointer$.offset_96| .cse3 (store (select |v_#memory_$Pointer$.offset_96| .cse3) .cse4 (select (select |v_#memory_$Pointer$.offset_95| .cse3) .cse4))) |v_#memory_$Pointer$.offset_95|) (= (select |v_#valid_67| |v_ULTIMATE.start_main_#t~malloc58#1.base_6|) 0) (= (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 (select (select |v_#memory_$Pointer$.base_95| .cse6) .cse7))) |v_#memory_$Pointer$.base_95|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_31| (store .cse8 .cse9 (store (select .cse8 .cse9) .cse10 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_31| .cse9) .cse10)))) (<= (+ |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 1) |c_#StackHeapBarrier|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_31| (store .cse11 .cse9 (store (select .cse11 .cse9) .cse10 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_31| .cse9) .cse10)))) (= (store .cse12 .cse6 (store (select .cse12 .cse6) .cse7 (select (select |v_#memory_$Pointer$.offset_97| .cse6) .cse7))) |v_#memory_$Pointer$.offset_97|) (= (let ((.cse13 (let ((.cse16 (let ((.cse17 (store |v_#memory_int_102| .cse6 (store (select |v_#memory_int_102| .cse6) .cse7 32)))) (store .cse17 .cse18 (store (select .cse17 .cse18) .cse19 5))))) (store .cse16 .cse3 (store (select .cse16 .cse3) .cse4 8))))) (store .cse13 .cse14 (store (select .cse13 .cse14) .cse15 (select (select |v_#memory_int_103| .cse14) .cse15)))) |v_#memory_int_103|) (= (store |v_#length_55| |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 384) |c_#length|) (= (store |v_#memory_$Pointer$.base_97| .cse3 (store (select |v_#memory_$Pointer$.base_97| .cse3) .cse4 (select (select |v_#memory_$Pointer$.base_96| .cse3) .cse4))) |v_#memory_$Pointer$.base_96|) (not (= |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 0)) (= (store |v_#memory_$Pointer$.offset_97| .cse18 (store (select |v_#memory_$Pointer$.offset_97| .cse18) .cse19 (select (select |v_#memory_$Pointer$.offset_96| .cse18) .cse19))) |v_#memory_$Pointer$.offset_96|) (= (store |v_#memory_$Pointer$.base_95| .cse18 (store (select |v_#memory_$Pointer$.base_95| .cse18) .cse19 (select (select |v_#memory_$Pointer$.base_97| .cse18) .cse19))) |v_#memory_$Pointer$.base_97|) (= |c_#valid| (store |v_#valid_67| |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 1)) (= (store |v_#memory_int_422| .cse20 (store (select |v_#memory_int_422| .cse20) .cse21 (select (select |v_#memory_int_102| .cse20) .cse21))) |v_#memory_int_102|))))))) (and .cse0 (exists ((|v_#memory_$Pointer$.base_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_96| (Array Int (Array Int Int))) (|v_#valid_67| (Array Int Int)) (|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#memory_int_422| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_95| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int))) (|v_#length_55| (Array Int Int)) (|v_#memory_$Pointer$.offset_95| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc58#1.base_6| Int) (|v_#memory_$Pointer$.base_381| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_96| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_32| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_381| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int)))) (let ((.cse40 (select (select |v_#memory_$Pointer$.base_381| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse41 (+ (select (select |v_#memory_$Pointer$.offset_381| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 16)) (.cse34 (select (select |v_#memory_$Pointer$.base_96| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse35 (select (select |v_#memory_$Pointer$.offset_95| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (let ((.cse42 (store |v_#memory_$Pointer$.offset_95| .cse34 (store (select |v_#memory_$Pointer$.offset_95| .cse34) .cse35 0))) (.cse22 (store |v_#memory_$Pointer$.base_96| .cse34 (store (select |v_#memory_$Pointer$.base_96| .cse34) .cse35 |v_ULTIMATE.start_main_#t~malloc58#1.base_6|))) (.cse32 (store |v_#memory_$Pointer$.offset_381| .cse40 (store (select |v_#memory_$Pointer$.offset_381| .cse40) .cse41 8))) (.cse29 (store |v_#memory_$Pointer$.base_381| .cse40 (store (select |v_#memory_$Pointer$.base_381| .cse40) .cse41 |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse30 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse31 (+ (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4)) (.cse27 (select (select |v_#memory_$Pointer$.base_97| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse28 (+ (select (select |v_#memory_$Pointer$.offset_96| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 20)) (.cse38 (select (select |v_#memory_$Pointer$.base_95| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse39 (+ (select (select |v_#memory_$Pointer$.offset_97| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 8)) (.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse24 (+ (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 40))) (and (= (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse23) .cse24))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_32|) (let ((.cse25 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse26 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (or (not (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse25) .cse26) 0)) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse25) .cse26) 0)))) (= (store |v_#memory_$Pointer$.offset_96| .cse27 (store (select |v_#memory_$Pointer$.offset_96| .cse27) .cse28 (select (select |v_#memory_$Pointer$.offset_95| .cse27) .cse28))) |v_#memory_$Pointer$.offset_95|) (= (select |v_#valid_67| |v_ULTIMATE.start_main_#t~malloc58#1.base_6|) 0) (= (store .cse29 .cse30 (store (select .cse29 .cse30) .cse31 (select (select |v_#memory_$Pointer$.base_95| .cse30) .cse31))) |v_#memory_$Pointer$.base_95|) (<= (+ |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 1) |c_#StackHeapBarrier|) (= (store .cse32 .cse30 (store (select .cse32 .cse30) .cse31 (select (select |v_#memory_$Pointer$.offset_97| .cse30) .cse31))) |v_#memory_$Pointer$.offset_97|) (= (let ((.cse33 (let ((.cse36 (let ((.cse37 (store |v_#memory_int_102| .cse30 (store (select |v_#memory_int_102| .cse30) .cse31 32)))) (store .cse37 .cse38 (store (select .cse37 .cse38) .cse39 5))))) (store .cse36 .cse27 (store (select .cse36 .cse27) .cse28 8))))) (store .cse33 .cse34 (store (select .cse33 .cse34) .cse35 (select (select |v_#memory_int_103| .cse34) .cse35)))) |v_#memory_int_103|) (= (store |v_#length_55| |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 384) |c_#length|) (= (store |v_#memory_$Pointer$.base_97| .cse27 (store (select |v_#memory_$Pointer$.base_97| .cse27) .cse28 (select (select |v_#memory_$Pointer$.base_96| .cse27) .cse28))) |v_#memory_$Pointer$.base_96|) (not (= |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 0)) (= (store |v_#memory_$Pointer$.offset_97| .cse38 (store (select |v_#memory_$Pointer$.offset_97| .cse38) .cse39 (select (select |v_#memory_$Pointer$.offset_96| .cse38) .cse39))) |v_#memory_$Pointer$.offset_96|) (= (store |v_#memory_$Pointer$.base_95| .cse38 (store (select |v_#memory_$Pointer$.base_95| .cse38) .cse39 (select (select |v_#memory_$Pointer$.base_97| .cse38) .cse39))) |v_#memory_$Pointer$.base_97|) (= |c_#valid| (store |v_#valid_67| |v_ULTIMATE.start_main_#t~malloc58#1.base_6| 1)) (= (store |v_#memory_int_422| .cse40 (store (select |v_#memory_int_422| .cse40) .cse41 (select (select |v_#memory_int_102| .cse40) .cse41))) |v_#memory_int_102|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (store .cse42 .cse23 (store (select .cse42 .cse23) .cse24 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse23) .cse24)))))))))))) (= |c_ULTIMATE.start_main_~user~0#1.offset| 0) (<= 0 (+ |c_ULTIMATE.start_main_~sum~0#1| 2147483648)) (<= |c_ULTIMATE.start_main_~sum~0#1| 2147483647) (<= 1 |c_#StackHeapBarrier|) (<= 0 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2024-11-09 04:58:25,029 WARN L286 SmtUtils]: Spent 30.60s on a formula simplification that was a NOOP. DAG size: 218 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)