./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/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_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 07:08:49,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:08:49,212 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 07:08:49,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:08:49,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:08:49,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:08:49,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:08:49,259 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:08:49,260 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:08:49,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:08:49,261 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 07:08:49,262 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 07:08:49,262 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 07:08:49,263 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 07:08:49,265 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 07:08:49,266 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 07:08:49,266 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 07:08:49,266 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 07:08:49,266 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 07:08:49,267 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 07:08:49,267 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 07:08:49,274 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 07:08:49,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:08:49,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:08:49,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:08:49,276 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:08:49,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:08:49,277 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:08:49,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:08:49,277 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:08:49,278 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:08:49,278 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:08:49,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:08:49,279 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:08:49,279 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:08:49,285 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:08:49,287 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:08:49,287 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:08:49,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:08:49,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:08:49,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:08:49,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:08:49,288 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:08:49,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:08:49,290 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 07:08:49,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:08:49,290 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:08:49,291 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 07:08:49,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:08:49,291 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_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/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_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 [2024-11-09 07:08:49,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:08:49,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:08:49,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:08:49,607 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:08:49,607 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:08:49,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-simple/dll2c_append_unequal.i Unable to find full path for "g++" [2024-11-09 07:08:51,579 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:08:51,832 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:08:51,833 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2024-11-09 07:08:51,850 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/data/132f8ede0/8e282a6d767d42158f948bad31031150/FLAGc421c16a0 [2024-11-09 07:08:51,866 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/data/132f8ede0/8e282a6d767d42158f948bad31031150 [2024-11-09 07:08:51,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:08:51,870 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:08:51,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:08:51,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:08:51,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:08:51,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:08:51" (1/1) ... [2024-11-09 07:08:51,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53adcc90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:51, skipping insertion in model container [2024-11-09 07:08:51,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:08:51" (1/1) ... [2024-11-09 07:08:51,929 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:08:52,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:08:52,377 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:08:52,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:08:52,477 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:08:52,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:52 WrapperNode [2024-11-09 07:08:52,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:08:52,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:08:52,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:08:52,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:08:52,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:52" (1/1) ... [2024-11-09 07:08:52,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:52" (1/1) ... [2024-11-09 07:08:52,537 INFO L138 Inliner]: procedures = 127, calls = 50, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 154 [2024-11-09 07:08:52,538 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:08:52,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:08:52,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:08:52,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:08:52,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:52" (1/1) ... [2024-11-09 07:08:52,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:52" (1/1) ... [2024-11-09 07:08:52,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:52" (1/1) ... [2024-11-09 07:08:52,566 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:52" (1/1) ... [2024-11-09 07:08:52,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:52" (1/1) ... [2024-11-09 07:08:52,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:52" (1/1) ... [2024-11-09 07:08:52,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:52" (1/1) ... [2024-11-09 07:08:52,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:52" (1/1) ... [2024-11-09 07:08:52,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:08:52,627 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:08:52,631 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:08:52,631 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:08:52,637 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:52" (1/1) ... [2024-11-09 07:08:52,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:08:52,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:08:52,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 07:08:52,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 07:08:52,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 07:08:52,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 07:08:52,768 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 07:08:52,768 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 07:08:52,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:08:52,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:08:52,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:08:52,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 07:08:52,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 07:08:52,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:08:52,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 07:08:52,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 07:08:52,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:08:52,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:08:53,020 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:08:53,023 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:08:53,537 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-11-09 07:08:53,538 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:08:53,609 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:08:53,611 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 07:08:53,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:08:53 BoogieIcfgContainer [2024-11-09 07:08:53,612 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:08:53,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:08:53,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:08:53,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:08:53,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:08:51" (1/3) ... [2024-11-09 07:08:53,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc806dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:08:53, skipping insertion in model container [2024-11-09 07:08:53,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:08:52" (2/3) ... [2024-11-09 07:08:53,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc806dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:08:53, skipping insertion in model container [2024-11-09 07:08:53,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:08:53" (3/3) ... [2024-11-09 07:08:53,623 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2024-11-09 07:08:53,642 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:08:53,642 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2024-11-09 07:08:53,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:08:53,701 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=None, 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;@69cd8933, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:08:53,701 INFO L334 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2024-11-09 07:08:53,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 60 states have (on average 2.3) internal successors, (138), 124 states have internal predecessors, (138), 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 07:08:53,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:08:53,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:08:53,712 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:08:53,713 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 07:08:53,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:08:53,718 INFO L85 PathProgramCache]: Analyzing trace with hash 245729266, now seen corresponding path program 1 times [2024-11-09 07:08:53,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:08:53,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419400569] [2024-11-09 07:08:53,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:08:53,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:08:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:08:53,973 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 07:08:53,974 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:08:53,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419400569] [2024-11-09 07:08:53,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419400569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:08:53,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:08:53,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:08:53,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475903611] [2024-11-09 07:08:53,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:08:53,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:08:53,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:08:54,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:08:54,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:08:54,028 INFO L87 Difference]: Start difference. First operand has 129 states, 60 states have (on average 2.3) internal successors, (138), 124 states have internal predecessors, (138), 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 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:08:54,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:08:54,217 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2024-11-09 07:08:54,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:08:54,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 07:08:54,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:08:54,229 INFO L225 Difference]: With dead ends: 125 [2024-11-09 07:08:54,230 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 07:08:54,232 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 07:08:54,236 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:08:54,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 188 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:08:54,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 07:08:54,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-09 07:08:54,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 58 states have (on average 2.206896551724138) internal successors, (128), 118 states have internal predecessors, (128), 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 07:08:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2024-11-09 07:08:54,286 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 5 [2024-11-09 07:08:54,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:08:54,287 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2024-11-09 07:08:54,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:08:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2024-11-09 07:08:54,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:08:54,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:08:54,289 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:08:54,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:08:54,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 07:08:54,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:08:54,290 INFO L85 PathProgramCache]: Analyzing trace with hash 245729267, now seen corresponding path program 1 times [2024-11-09 07:08:54,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:08:54,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450170723] [2024-11-09 07:08:54,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:08:54,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:08:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:08:54,432 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 07:08:54,432 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:08:54,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450170723] [2024-11-09 07:08:54,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450170723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:08:54,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:08:54,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:08:54,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775673402] [2024-11-09 07:08:54,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:08:54,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:08:54,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:08:54,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:08:54,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:08:54,437 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:08:54,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:08:54,573 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2024-11-09 07:08:54,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:08:54,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 07:08:54,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:08:54,576 INFO L225 Difference]: With dead ends: 120 [2024-11-09 07:08:54,577 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 07:08:54,577 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 07:08:54,579 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 2 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:08:54,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 192 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:08:54,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 07:08:54,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-09 07:08:54,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 58 states have (on average 2.1551724137931036) internal successors, (125), 115 states have internal predecessors, (125), 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 07:08:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2024-11-09 07:08:54,605 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 5 [2024-11-09 07:08:54,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:08:54,605 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2024-11-09 07:08:54,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:08:54,606 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2024-11-09 07:08:54,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:08:54,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:08:54,608 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:08:54,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:08:54,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 07:08:54,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:08:54,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1579504894, now seen corresponding path program 1 times [2024-11-09 07:08:54,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:08:54,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329775190] [2024-11-09 07:08:54,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:08:54,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:08:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:08:54,767 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 07:08:54,768 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:08:54,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329775190] [2024-11-09 07:08:54,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329775190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:08:54,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:08:54,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:08:54,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207048266] [2024-11-09 07:08:54,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:08:54,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:08:54,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:08:54,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:08:54,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:08:54,775 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:08:54,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:08:54,843 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2024-11-09 07:08:54,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:08:54,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-09 07:08:54,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:08:54,845 INFO L225 Difference]: With dead ends: 121 [2024-11-09 07:08:54,845 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 07:08:54,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:08:54,847 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 11 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:08:54,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 219 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:08:54,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 07:08:54,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-09 07:08:54,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 59 states have (on average 2.1186440677966103) internal successors, (125), 116 states have internal predecessors, (125), 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 07:08:54,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2024-11-09 07:08:54,856 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 11 [2024-11-09 07:08:54,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:08:54,858 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2024-11-09 07:08:54,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:08:54,858 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2024-11-09 07:08:54,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:08:54,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:08:54,859 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:08:54,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:08:54,859 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 07:08:54,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:08:54,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1410546254, now seen corresponding path program 1 times [2024-11-09 07:08:54,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:08:54,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841320624] [2024-11-09 07:08:54,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:08:54,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:08:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:08:55,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:08:55,139 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:08:55,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841320624] [2024-11-09 07:08:55,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841320624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:08:55,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:08:55,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:08:55,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166738123] [2024-11-09 07:08:55,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:08:55,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:08:55,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:08:55,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:08:55,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:08:55,145 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:08:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:08:55,518 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2024-11-09 07:08:55,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:08:55,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-09 07:08:55,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:08:55,521 INFO L225 Difference]: With dead ends: 120 [2024-11-09 07:08:55,523 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 07:08:55,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:08:55,525 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 7 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:08:55,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 354 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:08:55,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 07:08:55,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-09 07:08:55,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 59 states have (on average 2.1016949152542375) internal successors, (124), 115 states have internal predecessors, (124), 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 07:08:55,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2024-11-09 07:08:55,538 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 20 [2024-11-09 07:08:55,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:08:55,539 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2024-11-09 07:08:55,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:08:55,540 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2024-11-09 07:08:55,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:08:55,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:08:55,541 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:08:55,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:08:55,541 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 07:08:55,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:08:55,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1410546253, now seen corresponding path program 1 times [2024-11-09 07:08:55,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:08:55,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236339187] [2024-11-09 07:08:55,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:08:55,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:08:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:08:55,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:08:55,882 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:08:55,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236339187] [2024-11-09 07:08:55,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236339187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:08:55,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:08:55,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:08:55,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881668112] [2024-11-09 07:08:55,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:08:55,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:08:55,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:08:55,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:08:55,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:08:55,886 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:08:56,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:08:56,170 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2024-11-09 07:08:56,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:08:56,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-09 07:08:56,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:08:56,172 INFO L225 Difference]: With dead ends: 119 [2024-11-09 07:08:56,172 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 07:08:56,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:08:56,174 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 6 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:08:56,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 378 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:08:56,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 07:08:56,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-09 07:08:56,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 114 states have internal predecessors, (123), 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 07:08:56,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2024-11-09 07:08:56,193 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 20 [2024-11-09 07:08:56,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:08:56,193 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2024-11-09 07:08:56,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:08:56,193 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2024-11-09 07:08:56,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:08:56,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:08:56,194 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:08:56,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:08:56,195 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 07:08:56,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:08:56,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1674715155, now seen corresponding path program 1 times [2024-11-09 07:08:56,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:08:56,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295263374] [2024-11-09 07:08:56,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:08:56,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:08:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:08:56,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:08:56,604 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:08:56,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295263374] [2024-11-09 07:08:56,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295263374] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:08:56,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185861549] [2024-11-09 07:08:56,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:08:56,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:08:56,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:08:56,608 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:08:56,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:08:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:08:56,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 07:08:56,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:08:56,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:08:56,933 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-09 07:08:57,034 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:08:57,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 07:08:57,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-09 07:08:57,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:08:57,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185861549] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:08:57,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [501012366] [2024-11-09 07:08:57,209 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 07:08:57,210 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:08:57,215 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:08:57,223 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:08:57,224 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:08:59,132 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 07:09:00,124 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:09:15,510 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1451#(and (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.offset_90| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_90| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_90| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 0)))) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#memory_$Pointer$.base_90| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_90| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_90| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))))) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) 1)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#memory_int_70| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_70| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_70| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))))) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-09 07:09:15,510 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:09:15,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:09:15,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2024-11-09 07:09:15,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210120064] [2024-11-09 07:09:15,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:09:15,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:09:15,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:09:15,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:09:15,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=476, Unknown=3, NotChecked=44, Total=600 [2024-11-09 07:09:15,513 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 11 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:09:16,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:09:16,712 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2024-11-09 07:09:16,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:09:16,713 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-09 07:09:16,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:09:16,715 INFO L225 Difference]: With dead ends: 125 [2024-11-09 07:09:16,715 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 07:09:16,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=91, Invalid=560, Unknown=3, NotChecked=48, Total=702 [2024-11-09 07:09:16,717 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:09:16,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 511 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 491 Invalid, 0 Unknown, 133 Unchecked, 1.0s Time] [2024-11-09 07:09:16,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 07:09:16,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-09 07:09:16,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 64 states have (on average 2.03125) internal successors, (130), 119 states have internal predecessors, (130), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:09:16,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2024-11-09 07:09:16,726 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 22 [2024-11-09 07:09:16,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:09:16,726 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2024-11-09 07:09:16,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:09:16,727 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2024-11-09 07:09:16,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:09:16,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:09:16,727 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:09:16,750 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:09:16,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:09:16,932 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 07:09:16,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:09:16,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1674715156, now seen corresponding path program 1 times [2024-11-09 07:09:16,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:09:16,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637457000] [2024-11-09 07:09:16,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:09:16,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:09:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:09:17,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:09:17,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:09:17,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637457000] [2024-11-09 07:09:17,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637457000] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:09:17,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076539565] [2024-11-09 07:09:17,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:09:17,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:09:17,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:09:17,405 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:09:17,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:09:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:09:17,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 07:09:17,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:09:17,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:09:17,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:09:17,923 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-09 07:09:17,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:09:17,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:09:18,012 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:09:18,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:09:18,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-09 07:09:18,105 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:09:18,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076539565] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:09:18,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [213965363] [2024-11-09 07:09:18,445 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 07:09:18,445 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:09:18,445 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:09:18,446 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:09:18,446 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:09:19,438 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 07:09:20,130 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:09:36,930 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1814#(and (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_104| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_104| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_104| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_int_84| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_84| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_84| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.offset_104| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_104| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_104| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 0)))) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (<= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) 7) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-09 07:09:36,931 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:09:36,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:09:36,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-09 07:09:36,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248663616] [2024-11-09 07:09:36,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:09:36,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 07:09:36,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:09:36,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 07:09:36,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=774, Unknown=3, NotChecked=56, Total=930 [2024-11-09 07:09:36,934 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand has 16 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:09:38,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:09:38,975 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2024-11-09 07:09:38,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:09:38,976 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 22 [2024-11-09 07:09:38,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:09:38,977 INFO L225 Difference]: With dead ends: 125 [2024-11-09 07:09:38,977 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 07:09:38,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=125, Invalid=998, Unknown=3, NotChecked=64, Total=1190 [2024-11-09 07:09:38,979 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:09:38,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 703 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 806 Invalid, 0 Unknown, 132 Unchecked, 1.7s Time] [2024-11-09 07:09:38,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 07:09:38,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-09 07:09:38,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 64 states have (on average 2.015625) internal successors, (129), 119 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:09:38,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2024-11-09 07:09:38,988 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 22 [2024-11-09 07:09:38,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:09:38,988 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2024-11-09 07:09:38,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:09:38,989 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2024-11-09 07:09:38,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:09:38,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:09:38,990 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:09:39,016 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 07:09:39,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:09:39,195 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 07:09:39,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:09:39,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1211317322, now seen corresponding path program 1 times [2024-11-09 07:09:39,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:09:39,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499183590] [2024-11-09 07:09:39,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:09:39,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:09:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:09:39,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:09:39,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:09:39,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499183590] [2024-11-09 07:09:39,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499183590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:09:39,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513041942] [2024-11-09 07:09:39,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:09:39,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:09:39,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:09:39,359 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:09:39,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:09:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:09:39,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:09:39,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:09:39,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:09:39,552 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:09:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:09:39,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513041942] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:09:39,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [348952844] [2024-11-09 07:09:39,625 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 07:09:39,625 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:09:39,625 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:09:39,625 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:09:39,625 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:09:40,551 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 07:09:41,227 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:10:01,861 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2229#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_19| Int)) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_19|) 1))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-09 07:10:01,861 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:10:01,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:10:01,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-09 07:10:01,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58198227] [2024-11-09 07:10:01,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:10:01,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:10:01,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:10:01,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:10:01,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=360, Unknown=4, NotChecked=0, Total=420 [2024-11-09 07:10:01,864 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:10:02,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:10:02,087 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2024-11-09 07:10:02,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:10:02,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-11-09 07:10:02,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:10:02,089 INFO L225 Difference]: With dead ends: 125 [2024-11-09 07:10:02,089 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 07:10:02,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=56, Invalid=360, Unknown=4, NotChecked=0, Total=420 [2024-11-09 07:10:02,090 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:10:02,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 541 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:10:02,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 07:10:02,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-09 07:10:02,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 64 states have (on average 2.0) internal successors, (128), 119 states have internal predecessors, (128), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:10:02,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2024-11-09 07:10:02,099 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 24 [2024-11-09 07:10:02,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:10:02,099 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2024-11-09 07:10:02,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:10:02,100 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2024-11-09 07:10:02,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:10:02,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:10:02,101 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] [2024-11-09 07:10:02,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 07:10:02,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:10:02,302 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 07:10:02,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:10:02,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1099070349, now seen corresponding path program 1 times [2024-11-09 07:10:02,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:10:02,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518055100] [2024-11-09 07:10:02,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:10:02,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:10:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:10:02,441 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:10:02,442 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:10:02,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518055100] [2024-11-09 07:10:02,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518055100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:10:02,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012307901] [2024-11-09 07:10:02,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:10:02,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:10:02,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:10:02,445 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:10:02,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:10:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:10:02,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 07:10:02,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:10:02,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:10:02,832 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-09 07:10:02,926 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:10:02,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 07:10:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-11-09 07:10:02,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:10:03,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012307901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:10:03,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1276591119] [2024-11-09 07:10:03,092 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 07:10:03,093 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:10:03,093 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:10:03,093 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:10:03,093 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:10:04,252 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 07:10:04,865 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:10:29,138 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2601#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_20| Int)) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_20|) 1))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-09 07:10:29,138 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:10:29,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:10:29,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2024-11-09 07:10:29,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34111944] [2024-11-09 07:10:29,139 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:10:29,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:10:29,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:10:29,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:10:29,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=570, Unknown=6, NotChecked=48, Total=702 [2024-11-09 07:10:29,143 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand has 10 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:10:30,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:10:30,544 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2024-11-09 07:10:30,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:10:30,545 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2024-11-09 07:10:30,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:10:30,547 INFO L225 Difference]: With dead ends: 124 [2024-11-09 07:10:30,547 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 07:10:30,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=95, Invalid=715, Unknown=6, NotChecked=54, Total=870 [2024-11-09 07:10:30,550 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 9 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:10:30,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 449 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 414 Invalid, 0 Unknown, 130 Unchecked, 1.1s Time] [2024-11-09 07:10:30,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 07:10:30,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-09 07:10:30,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 64 states have (on average 1.984375) internal successors, (127), 118 states have internal predecessors, (127), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:10:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2024-11-09 07:10:30,561 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 25 [2024-11-09 07:10:30,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:10:30,562 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2024-11-09 07:10:30,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:10:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2024-11-09 07:10:30,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:10:30,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:10:30,564 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] [2024-11-09 07:10:30,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 07:10:30,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:10:30,769 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 07:10:30,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:10:30,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1099070350, now seen corresponding path program 1 times [2024-11-09 07:10:30,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:10:30,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086512616] [2024-11-09 07:10:30,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:10:30,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:10:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:10:31,310 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:10:31,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:10:31,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086512616] [2024-11-09 07:10:31,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086512616] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:10:31,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868108169] [2024-11-09 07:10:31,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:10:31,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:10:31,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:10:31,314 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:10:31,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:10:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:10:31,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 07:10:31,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:10:31,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:10:31,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:10:31,995 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-09 07:10:32,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:10:32,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:10:32,093 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:10:32,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:10:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-09 07:10:32,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:10:32,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868108169] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:10:32,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [105332276] [2024-11-09 07:10:32,611 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 07:10:32,612 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:10:32,612 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:10:32,612 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:10:32,613 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:10:33,997 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 07:10:34,548 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:10:53,411 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2984#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_21| Int)) (<= (select |#length| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_21|) 3)) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-09 07:10:53,412 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:10:53,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:10:53,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-09 07:10:53,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118666519] [2024-11-09 07:10:53,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:10:53,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 07:10:53,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:10:53,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 07:10:53,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=887, Unknown=3, NotChecked=60, Total=1056 [2024-11-09 07:10:53,416 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand has 15 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:10:55,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:10:55,076 INFO L93 Difference]: Finished difference Result 143 states and 159 transitions. [2024-11-09 07:10:55,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:10:55,077 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2024-11-09 07:10:55,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:10:55,080 INFO L225 Difference]: With dead ends: 143 [2024-11-09 07:10:55,081 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 07:10:55,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=137, Invalid=1124, Unknown=3, NotChecked=68, Total=1332 [2024-11-09 07:10:55,083 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 13 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:10:55,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 778 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 478 Invalid, 0 Unknown, 154 Unchecked, 1.3s Time] [2024-11-09 07:10:55,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 07:10:55,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2024-11-09 07:10:55,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 74 states have (on average 1.9189189189189189) internal successors, (142), 128 states have internal predecessors, (142), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:10:55,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 152 transitions. [2024-11-09 07:10:55,092 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 152 transitions. Word has length 25 [2024-11-09 07:10:55,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:10:55,092 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 152 transitions. [2024-11-09 07:10:55,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:10:55,093 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 152 transitions. [2024-11-09 07:10:55,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:10:55,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:10:55,094 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] [2024-11-09 07:10:55,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 07:10:55,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 07:10:55,295 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 07:10:55,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:10:55,295 INFO L85 PathProgramCache]: Analyzing trace with hash -288557544, now seen corresponding path program 1 times [2024-11-09 07:10:55,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:10:55,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015979195] [2024-11-09 07:10:55,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:10:55,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:10:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:10:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:10:55,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:10:55,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015979195] [2024-11-09 07:10:55,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015979195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:10:55,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:10:55,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:10:55,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571780444] [2024-11-09 07:10:55,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:10:55,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:10:55,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:10:55,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:10:55,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:10:55,607 INFO L87 Difference]: Start difference. First operand 135 states and 152 transitions. Second operand has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:10:56,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:10:56,519 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2024-11-09 07:10:56,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:10:56,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-09 07:10:56,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:10:56,521 INFO L225 Difference]: With dead ends: 134 [2024-11-09 07:10:56,521 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 07:10:56,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:10:56,522 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 7 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:10:56,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 413 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 07:10:56,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 07:10:56,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-09 07:10:56,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 74 states have (on average 1.9054054054054055) internal successors, (141), 127 states have internal predecessors, (141), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:10:56,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 151 transitions. [2024-11-09 07:10:56,529 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 151 transitions. Word has length 26 [2024-11-09 07:10:56,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:10:56,530 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 151 transitions. [2024-11-09 07:10:56,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:10:56,530 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 151 transitions. [2024-11-09 07:10:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:10:56,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:10:56,531 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] [2024-11-09 07:10:56,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:10:56,532 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 07:10:56,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:10:56,533 INFO L85 PathProgramCache]: Analyzing trace with hash -288557543, now seen corresponding path program 1 times [2024-11-09 07:10:56,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:10:56,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234859329] [2024-11-09 07:10:56,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:10:56,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:10:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:10:57,019 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:10:57,020 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:10:57,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234859329] [2024-11-09 07:10:57,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234859329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:10:57,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:10:57,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:10:57,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264754231] [2024-11-09 07:10:57,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:10:57,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:10:57,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:10:57,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:10:57,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:10:57,024 INFO L87 Difference]: Start difference. First operand 134 states and 151 transitions. Second operand has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:10:57,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:10:57,992 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2024-11-09 07:10:57,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:10:57,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-09 07:10:57,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:10:57,994 INFO L225 Difference]: With dead ends: 133 [2024-11-09 07:10:57,994 INFO L226 Difference]: Without dead ends: 133 [2024-11-09 07:10:57,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:10:57,995 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 6 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:10:57,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 438 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 07:10:57,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-09 07:10:58,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-09 07:10:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 74 states have (on average 1.8918918918918919) internal successors, (140), 126 states have internal predecessors, (140), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:10:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 150 transitions. [2024-11-09 07:10:58,006 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 150 transitions. Word has length 26 [2024-11-09 07:10:58,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:10:58,006 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 150 transitions. [2024-11-09 07:10:58,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:10:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 150 transitions. [2024-11-09 07:10:58,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:10:58,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:10:58,008 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:10:58,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:10:58,008 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 07:10:58,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:10:58,009 INFO L85 PathProgramCache]: Analyzing trace with hash 863519711, now seen corresponding path program 1 times [2024-11-09 07:10:58,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:10:58,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288926624] [2024-11-09 07:10:58,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:10:58,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:10:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:10:59,079 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:10:59,080 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:10:59,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288926624] [2024-11-09 07:10:59,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288926624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:10:59,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737521419] [2024-11-09 07:10:59,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:10:59,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:10:59,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:10:59,083 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:10:59,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 07:10:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:10:59,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 07:10:59,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:10:59,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:10:59,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:10:59,407 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-09 07:10:59,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:10:59,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:10:59,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:10:59,546 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-09 07:10:59,593 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 07:10:59,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 07:10:59,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:10:59,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:10:59,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:10:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 10 not checked. [2024-11-09 07:10:59,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:11:00,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737521419] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:11:00,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1021743801] [2024-11-09 07:11:00,064 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-09 07:11:00,065 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:11:00,065 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:11:00,066 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:11:00,066 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:11:01,424 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2024-11-09 07:11:01,471 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:11:15,642 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3962#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_21| Int)) (and (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_append_~head#1.base_21|) 1)) (or (and (exists ((|v_#memory_int_154| (Array Int (Array Int Int))) (|v_#memory_int_155| (Array Int (Array Int Int))) (|v_#memory_int_156| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_156| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_156| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 5))) (= (store |v_#memory_int_155| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_155| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_156| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_156|) (= (store |v_#memory_int_154| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_154| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_155| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_155|))) (exists ((|v_#memory_int_160| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_180| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_#memory_$Pointer$.base_180| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_76| (Array Int Int)) (|v_#memory_int_161| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_44| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select (select (store (store |v_#memory_$Pointer$.offset_180| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_180| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_180| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_180| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 8 (select |v_#length_BEFORE_CALL_76| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (store (store |v_#memory_$Pointer$.base_180| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_180| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_180| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_180| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= |v_old(#memory_int)_AFTER_CALL_44| (store |v_#memory_int_161| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_161| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select |v_old(#valid)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (<= 4 (select |v_#length_BEFORE_CALL_76| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= |v_#memory_int_161| (store |v_#memory_int_160| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_160| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_161| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0)))))) (exists ((|v_#memory_$Pointer$.offset_174| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_174| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_174| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (exists ((|v_#length_147| (Array Int Int))) (= (store |v_#length_147| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12) |#length|)) (= |v_ULTIMATE.start_dll_circular_append_~head#1.base_21| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_173| (Array Int Int))) (and (= |#valid| (store |v_#valid_173| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1)) (= (select |v_#valid_173| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.base_174| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_174| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_174| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))) |#memory_$Pointer$.base|)) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0))) (and (exists ((|v_#memory_int_154| (Array Int (Array Int Int))) (|v_#memory_int_155| (Array Int (Array Int Int))) (|v_#memory_int_156| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_156| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_156| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 5))) (= (store |v_#memory_int_155| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_155| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_156| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_156|) (= (store |v_#memory_int_154| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_154| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_155| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_155|))) (exists ((|v_#memory_$Pointer$.offset_174| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_174| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_174| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (exists ((|v_#length_147| (Array Int Int))) (= (store |v_#length_147| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12) |#length|)) (= |v_ULTIMATE.start_dll_circular_append_~head#1.base_21| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_173| (Array Int Int))) (and (= |#valid| (store |v_#valid_173| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1)) (= (select |v_#valid_173| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.base_174| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_174| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_174| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_int_160| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_180| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_180| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_45| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_#memory_int_161| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_45| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_45| (store |v_#memory_int_161| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_161| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 8 (select |v_old(#length)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select |v_old(#valid)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= (select (select (store (store |v_#memory_$Pointer$.offset_180| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_180| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_180| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_180| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 4 (select |v_old(#length)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= (store |v_#memory_int_160| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_160| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_161| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_161|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (store (store |v_#memory_$Pointer$.base_180| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_180| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_180| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_180| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))))) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)))))) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_append_~data#1| 5) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| 0))' at error location [2024-11-09 07:11:15,643 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:11:15,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:11:15,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 14 [2024-11-09 07:11:15,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756406146] [2024-11-09 07:11:15,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:11:15,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 07:11:15,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:11:15,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 07:11:15,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1085, Unknown=4, NotChecked=134, Total=1332 [2024-11-09 07:11:15,645 INFO L87 Difference]: Start difference. First operand 133 states and 150 transitions. Second operand has 16 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 07:11:17,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:17,322 INFO L93 Difference]: Finished difference Result 143 states and 162 transitions. [2024-11-09 07:11:17,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:11:17,322 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 35 [2024-11-09 07:11:17,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:17,324 INFO L225 Difference]: With dead ends: 143 [2024-11-09 07:11:17,324 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 07:11:17,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=131, Invalid=1279, Unknown=4, NotChecked=146, Total=1560 [2024-11-09 07:11:17,326 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 202 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 264 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:17,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 381 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 510 Invalid, 0 Unknown, 264 Unchecked, 1.3s Time] [2024-11-09 07:11:17,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 07:11:17,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 125. [2024-11-09 07:11:17,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 74 states have (on average 1.7837837837837838) internal successors, (132), 118 states have internal predecessors, (132), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:11:17,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2024-11-09 07:11:17,333 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 35 [2024-11-09 07:11:17,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:17,334 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2024-11-09 07:11:17,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 07:11:17,335 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2024-11-09 07:11:17,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:11:17,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:17,336 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:17,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 07:11:17,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 07:11:17,541 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 07:11:17,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:17,541 INFO L85 PathProgramCache]: Analyzing trace with hash 863519712, now seen corresponding path program 1 times [2024-11-09 07:11:17,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:11:17,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500351283] [2024-11-09 07:11:17,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:17,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:18,873 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:11:18,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:11:18,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500351283] [2024-11-09 07:11:18,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500351283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:11:18,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060939228] [2024-11-09 07:11:18,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:18,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:11:18,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:11:18,876 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:11:18,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 07:11:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:19,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 07:11:19,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:11:19,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:11:19,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:11:19,222 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-09 07:11:19,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:19,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:11:19,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:11:19,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:19,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:11:19,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:11:19,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:19,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:11:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 07:11:19,861 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:11:19,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060939228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:11:19,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:11:19,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2024-11-09 07:11:19,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344314960] [2024-11-09 07:11:19,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:11:19,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:11:19,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:11:19,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:11:19,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=222, Unknown=1, NotChecked=30, Total=306 [2024-11-09 07:11:19,864 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:11:20,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:20,376 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2024-11-09 07:11:20,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:11:20,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-11-09 07:11:20,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:20,377 INFO L225 Difference]: With dead ends: 120 [2024-11-09 07:11:20,377 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 07:11:20,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=251, Unknown=1, NotChecked=32, Total=342 [2024-11-09 07:11:20,379 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 28 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:20,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 231 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 170 Invalid, 0 Unknown, 138 Unchecked, 0.4s Time] [2024-11-09 07:11:20,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 07:11:20,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-09 07:11:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 74 states have (on average 1.7162162162162162) internal successors, (127), 113 states have internal predecessors, (127), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:11:20,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 137 transitions. [2024-11-09 07:11:20,386 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 137 transitions. Word has length 35 [2024-11-09 07:11:20,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:20,387 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 137 transitions. [2024-11-09 07:11:20,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:11:20,387 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 137 transitions. [2024-11-09 07:11:20,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:11:20,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:20,389 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:20,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 07:11:20,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 07:11:20,590 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 07:11:20,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:20,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1595709988, now seen corresponding path program 1 times [2024-11-09 07:11:20,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:11:20,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706472177] [2024-11-09 07:11:20,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:20,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:20,729 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 07:11:20,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:11:20,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706472177] [2024-11-09 07:11:20,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706472177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:11:20,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:11:20,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:11:20,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913338026] [2024-11-09 07:11:20,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:11:20,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:11:20,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:11:20,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:11:20,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:11:20,733 INFO L87 Difference]: Start difference. First operand 120 states and 137 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:11:20,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:20,837 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2024-11-09 07:11:20,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:11:20,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-11-09 07:11:20,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:20,839 INFO L225 Difference]: With dead ends: 100 [2024-11-09 07:11:20,839 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 07:11:20,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:11:20,840 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:20,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:11:20,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 07:11:20,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-09 07:11:20,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 59 states have (on average 1.728813559322034) internal successors, (102), 95 states have internal predecessors, (102), 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 07:11:20,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2024-11-09 07:11:20,845 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 36 [2024-11-09 07:11:20,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:20,845 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2024-11-09 07:11:20,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:11:20,846 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2024-11-09 07:11:20,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 07:11:20,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:20,849 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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 07:11:20,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:11:20,849 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 07:11:20,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:20,850 INFO L85 PathProgramCache]: Analyzing trace with hash 913754720, now seen corresponding path program 1 times [2024-11-09 07:11:20,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:11:20,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951298530] [2024-11-09 07:11:20,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:20,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 07:11:21,103 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:11:21,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951298530] [2024-11-09 07:11:21,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951298530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:11:21,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:11:21,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:11:21,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841535105] [2024-11-09 07:11:21,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:11:21,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:11:21,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:11:21,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:11:21,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:11:21,106 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:11:21,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:21,872 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2024-11-09 07:11:21,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:11:21,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-11-09 07:11:21,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:21,873 INFO L225 Difference]: With dead ends: 96 [2024-11-09 07:11:21,873 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 07:11:21,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:11:21,874 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 17 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:21,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 266 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:11:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 07:11:21,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-09 07:11:21,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.6610169491525424) internal successors, (98), 91 states have internal predecessors, (98), 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 07:11:21,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2024-11-09 07:11:21,881 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 37 [2024-11-09 07:11:21,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:21,881 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2024-11-09 07:11:21,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:11:21,882 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2024-11-09 07:11:21,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 07:11:21,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:21,883 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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 07:11:21,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:11:21,884 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 07:11:21,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:21,884 INFO L85 PathProgramCache]: Analyzing trace with hash 913754721, now seen corresponding path program 1 times [2024-11-09 07:11:21,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:11:21,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032656958] [2024-11-09 07:11:21,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:21,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 07:11:22,291 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:11:22,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032656958] [2024-11-09 07:11:22,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032656958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:11:22,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:11:22,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:11:22,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026110258] [2024-11-09 07:11:22,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:11:22,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:11:22,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:11:22,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:11:22,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:11:22,294 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:11:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:22,814 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2024-11-09 07:11:22,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:11:22,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-11-09 07:11:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:22,816 INFO L225 Difference]: With dead ends: 92 [2024-11-09 07:11:22,816 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 07:11:22,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:11:22,817 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 16 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:22,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 278 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:11:22,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 07:11:22,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 07:11:22,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 87 states have internal predecessors, (94), 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 07:11:22,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2024-11-09 07:11:22,825 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 37 [2024-11-09 07:11:22,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:22,825 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2024-11-09 07:11:22,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:11:22,826 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2024-11-09 07:11:22,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 07:11:22,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:22,827 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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 07:11:22,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:11:22,827 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 07:11:22,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:22,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1738363807, now seen corresponding path program 1 times [2024-11-09 07:11:22,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:11:22,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014017824] [2024-11-09 07:11:22,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:22,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:24,651 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:11:24,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:11:24,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014017824] [2024-11-09 07:11:24,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014017824] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:11:24,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152566091] [2024-11-09 07:11:24,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:24,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:11:24,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:11:24,655 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:11:24,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 07:11:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:25,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 07:11:25,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:11:25,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-09 07:11:25,974 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_63| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_63|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_63| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_63|))) (<= (+ |v_node_create_~temp~0#1.base_63| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_63| (select |c_#valid| |v_node_create_~temp~0#1.base_63|))))) is different from true [2024-11-09 07:11:25,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:25,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 07:11:26,069 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-09 07:11:26,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-11-09 07:11:26,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 07:11:26,136 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:11:26,136 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:11:26,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152566091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:11:26,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:11:26,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [15] total 19 [2024-11-09 07:11:26,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790392100] [2024-11-09 07:11:26,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:11:26,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:11:26,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:11:26,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:11:26,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=295, Unknown=1, NotChecked=34, Total=380 [2024-11-09 07:11:26,139 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 12 states, 9 states have (on average 3.0) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:11:27,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:27,119 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2024-11-09 07:11:27,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:11:27,120 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.0) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-11-09 07:11:27,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:27,121 INFO L225 Difference]: With dead ends: 91 [2024-11-09 07:11:27,121 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 07:11:27,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=62, Invalid=361, Unknown=1, NotChecked=38, Total=462 [2024-11-09 07:11:27,122 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 7 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:27,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 380 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 363 Invalid, 0 Unknown, 125 Unchecked, 0.9s Time] [2024-11-09 07:11:27,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 07:11:27,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-09 07:11:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 59 states have (on average 1.576271186440678) internal successors, (93), 86 states have internal predecessors, (93), 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 07:11:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2024-11-09 07:11:27,129 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 38 [2024-11-09 07:11:27,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:27,129 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2024-11-09 07:11:27,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.0) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:11:27,130 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2024-11-09 07:11:27,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 07:11:27,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:27,131 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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 07:11:27,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 07:11:27,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 07:11:27,336 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 07:11:27,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:27,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1738363806, now seen corresponding path program 1 times [2024-11-09 07:11:27,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:11:27,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752573264] [2024-11-09 07:11:27,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:27,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:11:30,368 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:11:30,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752573264] [2024-11-09 07:11:30,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752573264] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:11:30,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807954998] [2024-11-09 07:11:30,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:30,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:11:30,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:11:30,372 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:11:30,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 07:11:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:30,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 07:11:30,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:11:30,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:11:31,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-09 07:11:31,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:11:42,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:42,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 07:11:42,370 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 07:11:42,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-09 07:11:42,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:42,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:11:43,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 07:11:43,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:11:43,419 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:11:43,419 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:12:34,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807954998] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:12:34,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2128900444] [2024-11-09 07:12:34,326 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-09 07:12:34,326 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:12:34,327 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:12:34,327 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:12:34,328 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:12:36,508 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2024-11-09 07:12:36,573 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:13:39,455 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5687#(and (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_dll_circular_append_~head#1.base|) (or (< (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 8))) (or (and (exists ((|v_#length_162| (Array Int Int))) (= |#length| (store |v_#length_162| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12))) (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_181| (Array Int Int))) (and (= (select |v_#valid_181| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |#valid| (store |v_#valid_181| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1)))) (exists ((|v_#memory_$Pointer$.offset_203| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_62| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_#memory_$Pointer$.base_206| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_62| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_62| (Array Int Int)) (|v_#memory_int_178| (Array Int (Array Int Int))) (|v_#memory_int_179| (Array Int (Array Int Int)))) (and (= (select (select (store (store |v_#memory_$Pointer$.offset_203| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_203| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_203| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_203| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 8 (select |v_old(#length)_AFTER_CALL_62| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |v_#memory_int_179| (store |v_#memory_int_178| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_178| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_179| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0)))) (= |v_old(#memory_int)_AFTER_CALL_62| (store |v_#memory_int_179| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_179| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_62| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| (store (store |v_#memory_$Pointer$.base_206| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_206| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_206| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_206| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 4 (select |v_old(#length)_AFTER_CALL_62| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= (select |v_old(#valid)_AFTER_CALL_62| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= (select |v_old(#valid)_AFTER_CALL_62| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_62| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1))) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_200| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_200| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_200| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_int_172| (Array Int (Array Int Int))) (|v_#memory_int_173| (Array Int (Array Int Int))) (|v_#memory_int_174| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_173| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_173| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_174| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_174|) (= |#memory_int| (store |v_#memory_int_174| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_174| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 5))) (= (store |v_#memory_int_172| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_172| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_173| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_173|))) (exists ((|v_#memory_$Pointer$.offset_197| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_197| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_197| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8)))))) (and (exists ((|v_#length_162| (Array Int Int))) (= |#length| (store |v_#length_162| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12))) (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_181| (Array Int Int))) (and (= (select |v_#valid_181| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= |#valid| (store |v_#valid_181| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1)))) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_200| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_200| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_200| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_int_172| (Array Int (Array Int Int))) (|v_#memory_int_173| (Array Int (Array Int Int))) (|v_#memory_int_174| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_173| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_173| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_174| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_174|) (= |#memory_int| (store |v_#memory_int_174| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_174| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 5))) (= (store |v_#memory_int_172| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_172| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_173| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_173|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_203| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (|v_#length_BEFORE_CALL_103| (Array Int Int)) (|v_#memory_$Pointer$.base_206| (Array Int (Array Int Int))) (|v_#memory_int_178| (Array Int (Array Int Int))) (|v_#memory_int_179| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_61| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_178| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_178| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_179| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_179|) (= (select (select (store (store |v_#memory_$Pointer$.offset_203| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_203| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_203| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_203| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 8 (select |v_#length_BEFORE_CALL_103| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select |v_old(#valid)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (store (store |v_#memory_$Pointer$.base_206| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_206| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_206| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_206| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_61|) (= (select |v_old(#valid)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (<= 4 (select |v_#length_BEFORE_CALL_103| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= |v_old(#memory_int)_AFTER_CALL_61| (store |v_#memory_int_179| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_179| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))))) (exists ((|v_#memory_$Pointer$.offset_197| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_197| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_197| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))))) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_append_~data#1| 5) (= (select |#valid| |ULTIMATE.start_dll_circular_append_~head#1.base|) 1) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)))) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_append_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| 0))' at error location [2024-11-09 07:13:39,455 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:13:39,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:13:39,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2024-11-09 07:13:39,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647090880] [2024-11-09 07:13:39,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:13:39,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 07:13:39,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:13:39,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 07:13:39,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2643, Unknown=43, NotChecked=0, Total=2862 [2024-11-09 07:13:39,459 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 28 states, 21 states have (on average 2.619047619047619) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 07:13:50,859 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 07:13:53,037 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 07:14:00,395 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 07:14:07,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 07:14:14,683 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 07:14:17,258 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 07:14:24,275 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 07:14:26,883 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 07:14:29,010 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 07:14:31,255 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 07:14:33,438 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 07:14:35,793 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 07:14:38,159 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 07:14:41,048 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 07:14:43,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:14:47,614 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 07:14:52,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:14:53,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:14:53,736 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2024-11-09 07:14:53,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:14:53,740 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 2.619047619047619) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2024-11-09 07:14:53,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:14:53,741 INFO L225 Difference]: With dead ends: 90 [2024-11-09 07:14:53,742 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 07:14:53,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 152.2s TimeCoverageRelationStatistics Valid=249, Invalid=3357, Unknown=54, NotChecked=0, Total=3660 [2024-11-09 07:14:53,744 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 78 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 7 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:14:53,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 747 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 822 Invalid, 17 Unknown, 0 Unchecked, 47.6s Time] [2024-11-09 07:14:53,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 07:14:53,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-09 07:14:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 85 states have internal predecessors, (92), 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 07:14:53,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2024-11-09 07:14:53,750 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 38 [2024-11-09 07:14:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:14:53,751 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2024-11-09 07:14:53,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 2.619047619047619) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 07:14:53,751 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2024-11-09 07:14:53,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 07:14:53,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:14:53,752 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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 07:14:53,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 07:14:53,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:14:53,953 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 07:14:53,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:14:53,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1945302014, now seen corresponding path program 1 times [2024-11-09 07:14:53,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:14:53,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025262032] [2024-11-09 07:14:53,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:14:53,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:14:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:03,255 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:15:03,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:15:03,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025262032] [2024-11-09 07:15:03,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025262032] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:15:03,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108399656] [2024-11-09 07:15:03,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:03,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:15:03,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:15:03,259 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:15:03,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 07:15:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:03,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-09 07:15:03,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:06,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2024-11-09 07:15:06,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:15:06,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 14 [2024-11-09 07:15:06,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:15:07,432 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_76| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_76|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_76| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_76|))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_76| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_76|))) (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_76| (select |c_#valid| |v_node_create_~temp~0#1.base_76|))) (<= (+ |v_node_create_~temp~0#1.base_76| 1) |c_#StackHeapBarrier|))) is different from true [2024-11-09 07:15:07,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:15:07,580 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 07:15:07,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 30 [2024-11-09 07:15:07,928 INFO L349 Elim1Store]: treesize reduction 96, result has 30.9 percent of original size [2024-11-09 07:15:07,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 52 [2024-11-09 07:15:07,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:15:07,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:15:08,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:15:09,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:15:09,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 17 [2024-11-09 07:15:09,413 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2024-11-09 07:15:09,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:15:11,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108399656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:15:11,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [133922832] [2024-11-09 07:15:11,262 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-09 07:15:11,262 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:15:11,263 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:15:11,263 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:15:11,263 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:15:12,862 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2024-11-09 07:15:12,927 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:16:18,241 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6071#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4)) (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_dll_circular_append_~head#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) 1) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (or (and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_224| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_224| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_224| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (exists ((|v_#length_169| (Array Int Int))) (= (store |v_#length_169| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12) |#length|)) (exists ((|v_#valid_191| (Array Int Int))) (and (= (select |v_#valid_191| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (store |v_#valid_191| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#valid|))) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_73| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_73| (Array Int Int)) (|v_#memory_$Pointer$.offset_226| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_73| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_73| (Array Int Int)) (|v_#memory_int_196| (Array Int (Array Int Int))) (|v_#memory_int_197| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_230| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_73| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (<= 4 (select |v_old(#length)_AFTER_CALL_73| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (<= 8 (select |v_old(#length)_AFTER_CALL_73| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select (select (store (store |v_#memory_$Pointer$.offset_226| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_226| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_226| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_226| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_int_196| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_196| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_197| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_197|) (= (select |v_old(#valid)_AFTER_CALL_73| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= |v_old(#memory_int)_AFTER_CALL_73| (store |v_#memory_int_197| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_197| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_73| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (store (store |v_#memory_$Pointer$.base_230| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_230| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_230| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_230| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_73|))) (exists ((|v_#memory_$Pointer$.offset_220| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_220| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_220| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_int_190| (Array Int (Array Int Int))) (|v_#memory_int_191| (Array Int (Array Int Int))) (|v_#memory_int_192| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_192| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_192| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 5))) (= (store |v_#memory_int_191| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_191| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_192| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_192|) (= (store |v_#memory_int_190| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_190| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_191| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_191|)))) (and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_224| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_224| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_224| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (exists ((|v_#length_169| (Array Int Int))) (= (store |v_#length_169| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12) |#length|)) (exists ((|v_#valid_191| (Array Int Int))) (and (= (select |v_#valid_191| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (store |v_#valid_191| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#valid|))) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_220| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_220| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_220| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_72| (Array Int Int)) (|v_#memory_$Pointer$.offset_226| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_72| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_72| (Array Int (Array Int Int))) (|v_#memory_int_196| (Array Int (Array Int Int))) (|v_#memory_int_197| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_230| (Array Int (Array Int Int)))) (and (= (select (select (store (store |v_#memory_$Pointer$.offset_226| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_226| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_226| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_226| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 4 (select |v_old(#length)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= (select |v_old(#valid)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |v_old(#memory_int)_AFTER_CALL_72| (store |v_#memory_int_197| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_197| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (store |v_#memory_int_196| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_196| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_197| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_197|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (store (store |v_#memory_$Pointer$.base_230| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_230| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_230| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_230| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 8 (select |v_old(#length)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select |v_old(#valid)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1))) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_int_190| (Array Int (Array Int Int))) (|v_#memory_int_191| (Array Int (Array Int Int))) (|v_#memory_int_192| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_192| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_192| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 5))) (= (store |v_#memory_int_191| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_191| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_192| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_192|) (= (store |v_#memory_int_190| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_190| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_191| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_191|))))) (= |ULTIMATE.start_dll_circular_append_~data#1| 5) (= (select |#valid| |ULTIMATE.start_dll_circular_append_~head#1.base|) 1) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0))) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)))) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_append_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4)) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4))) 1)) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| 0))' at error location [2024-11-09 07:16:18,241 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:16:18,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:16:18,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 28 [2024-11-09 07:16:18,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521031569] [2024-11-09 07:16:18,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:16:18,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 07:16:18,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:16:18,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 07:16:18,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2779, Unknown=10, NotChecked=106, Total=3080 [2024-11-09 07:16:18,245 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 29 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 26 states have internal predecessors, (47), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 07:16:30,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:16:30,838 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2024-11-09 07:16:30,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:16:30,840 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 26 states have internal predecessors, (47), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 39 [2024-11-09 07:16:30,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:16:30,841 INFO L225 Difference]: With dead ends: 89 [2024-11-09 07:16:30,841 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 07:16:30,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1198 ImplicationChecksByTransitivity, 78.9s TimeCoverageRelationStatistics Valid=259, Invalid=3641, Unknown=10, NotChecked=122, Total=4032 [2024-11-09 07:16:30,843 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 63 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:16:30,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 691 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 864 Invalid, 0 Unknown, 96 Unchecked, 8.1s Time] [2024-11-09 07:16:30,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 07:16:30,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 07:16:30,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 59 states have (on average 1.5423728813559323) internal successors, (91), 84 states have internal predecessors, (91), 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 07:16:30,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2024-11-09 07:16:30,848 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 39 [2024-11-09 07:16:30,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:16:30,848 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2024-11-09 07:16:30,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 26 states have internal predecessors, (47), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 07:16:30,849 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2024-11-09 07:16:30,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 07:16:30,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:16:30,850 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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 07:16:30,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 07:16:31,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:16:31,052 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 07:16:31,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:16:31,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1945302015, now seen corresponding path program 1 times [2024-11-09 07:16:31,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:16:31,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488443412] [2024-11-09 07:16:31,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:16:31,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:16:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:16:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:16:44,188 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:16:44,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488443412] [2024-11-09 07:16:44,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488443412] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:16:44,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442266654] [2024-11-09 07:16:44,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:16:44,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:16:44,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:16:44,191 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:16:44,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 07:16:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:16:44,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-09 07:16:44,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:16:44,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:16:44,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:16:48,558 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:16:48,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 07:16:48,685 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:16:48,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:16:52,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 1 [2024-11-09 07:16:52,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-09 07:16:53,337 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2024-11-09 07:16:53,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 36 [2024-11-09 07:16:53,500 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-09 07:16:53,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2024-11-09 07:16:53,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:16:53,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:16:55,342 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_87| Int)) (and (= (store |c_old(#length)| |v_node_create_~temp~0#1.base_87| (select |c_#length| |v_node_create_~temp~0#1.base_87|)) |c_#length|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_87| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_87|))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_87| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_87|))) (<= (+ |v_node_create_~temp~0#1.base_87| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_87|) 0))) is different from true [2024-11-09 07:16:55,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:16:55,502 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 07:16:55,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 78 [2024-11-09 07:16:55,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:16:55,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:16:55,575 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 07:16:55,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 78 [2024-11-09 07:16:55,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:16:55,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-11-09 07:16:55,860 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-09 07:16:55,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-09 07:16:57,256 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2024-11-09 07:16:57,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 29 [2024-11-09 07:16:57,393 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-09 07:16:57,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2024-11-09 07:16:57,842 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 07:16:57,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:17:01,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442266654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:17:01,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1543799138] [2024-11-09 07:17:01,290 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-09 07:17:01,290 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:17:01,291 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:17:01,291 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:17:01,291 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:17:02,615 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2024-11-09 07:17:02,693 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:18:13,611 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6473#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4)) (or (< (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4)) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4)) 4))) (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_dll_circular_append_~head#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) 1) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_append_~data#1| 5) (= (select |#valid| |ULTIMATE.start_dll_circular_append_~head#1.base|) 1) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0))) (or (and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_181| (Array Int Int))) (= (store |v_#length_181| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12) |#length|)) (exists ((|v_#memory_$Pointer$.base_248| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_248| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_248| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))) |#memory_$Pointer$.base|)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#memory_int_214| (Array Int (Array Int Int))) (|v_#memory_int_215| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_250| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_83| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_83| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_254| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select (select (store (store |v_#memory_$Pointer$.offset_250| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_250| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_250| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_250| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_int_214| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_214| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_215| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_215|) (= |v_old(#memory_int)_AFTER_CALL_83| (store |v_#memory_int_215| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_215| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (store (store |v_#memory_$Pointer$.base_254| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_254| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_254| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_254| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 4 (select |v_old(#length)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (<= 8 (select |v_old(#length)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select |v_old(#valid)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1))) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_244| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_244| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_244| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#valid_202| (Array Int Int))) (and (= |#valid| (store |v_#valid_202| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1)) (= (select |v_#valid_202| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (exists ((|v_#memory_int_208| (Array Int (Array Int Int))) (|v_#memory_int_209| (Array Int (Array Int Int))) (|v_#memory_int_210| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_209| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_209| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_210| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_210|) (= (store |v_#memory_int_208| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_208| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_209| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_209|) (= |#memory_int| (store |v_#memory_int_210| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_210| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 5)))))) (and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_181| (Array Int Int))) (= (store |v_#length_181| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12) |#length|)) (exists ((|v_#memory_$Pointer$.base_248| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_248| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_248| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))) |#memory_$Pointer$.base|)) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_244| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_244| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_244| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#valid_202| (Array Int Int))) (and (= |#valid| (store |v_#valid_202| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1)) (= (select |v_#valid_202| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_84| (Array Int Int)) (|v_#memory_int_214| (Array Int (Array Int Int))) (|v_#memory_int_215| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_84| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_250| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_84| (Array Int Int)) (|v_#memory_$Pointer$.base_254| (Array Int (Array Int Int)))) (and (= (store (store |v_#memory_$Pointer$.base_254| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_254| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_254| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_254| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_84|) (= (store |v_#memory_int_214| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_214| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_215| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_215|) (= (select |v_old(#valid)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= (select |v_old(#valid)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |v_old(#memory_int)_AFTER_CALL_84| (store |v_#memory_int_215| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_215| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 4 (select |v_old(#length)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (<= 8 (select |v_old(#length)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select (select (store (store |v_#memory_$Pointer$.offset_250| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_250| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_250| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_250| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_84| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (exists ((|v_#memory_int_208| (Array Int (Array Int Int))) (|v_#memory_int_209| (Array Int (Array Int Int))) (|v_#memory_int_210| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_209| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_209| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_210| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_210|) (= (store |v_#memory_int_208| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_208| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_209| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_209|) (= |#memory_int| (store |v_#memory_int_210| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_210| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 5))))))) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)))) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_append_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| 0))' at error location [2024-11-09 07:18:13,612 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:18:13,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:18:13,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 44 [2024-11-09 07:18:13,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962515503] [2024-11-09 07:18:13,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:18:13,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-09 07:18:13,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:18:13,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-09 07:18:13,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=4870, Unknown=9, NotChecked=140, Total=5256 [2024-11-09 07:18:13,615 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 45 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 37 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:18:37,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:37,096 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2024-11-09 07:18:37,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 07:18:37,099 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 37 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2024-11-09 07:18:37,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:37,100 INFO L225 Difference]: With dead ends: 88 [2024-11-09 07:18:37,100 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 07:18:37,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2251 ImplicationChecksByTransitivity, 98.9s TimeCoverageRelationStatistics Valid=380, Invalid=6925, Unknown=9, NotChecked=168, Total=7482 [2024-11-09 07:18:37,103 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 126 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 1754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:37,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 889 Invalid, 1754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1641 Invalid, 0 Unknown, 95 Unchecked, 14.4s Time] [2024-11-09 07:18:37,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 07:18:37,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-09 07:18:37,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 83 states have internal predecessors, (90), 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 07:18:37,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2024-11-09 07:18:37,107 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 39 [2024-11-09 07:18:37,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:37,108 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2024-11-09 07:18:37,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 37 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:18:37,108 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2024-11-09 07:18:37,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 07:18:37,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:37,109 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 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 07:18:37,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 07:18:37,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-09 07:18:37,310 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 07:18:37,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:37,310 INFO L85 PathProgramCache]: Analyzing trace with hash 794099621, now seen corresponding path program 1 times [2024-11-09 07:18:37,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:18:37,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197947172] [2024-11-09 07:18:37,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:37,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:18:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:38,061 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 07:18:38,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:18:38,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197947172] [2024-11-09 07:18:38,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197947172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:38,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:38,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:18:38,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344667283] [2024-11-09 07:18:38,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:38,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:18:38,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:18:38,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:18:38,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:18:38,064 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 7 states, 5 states have (on average 5.0) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:18:39,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:39,305 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2024-11-09 07:18:39,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:18:39,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.0) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-11-09 07:18:39,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:39,306 INFO L225 Difference]: With dead ends: 85 [2024-11-09 07:18:39,307 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 07:18:39,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:18:39,308 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 79 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:39,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 253 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 07:18:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 07:18:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-09 07:18:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 80 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 07:18:39,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2024-11-09 07:18:39,313 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 41 [2024-11-09 07:18:39,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:39,314 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2024-11-09 07:18:39,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.0) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:18:39,314 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2024-11-09 07:18:39,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:18:39,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:39,315 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 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 07:18:39,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 07:18:39,316 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 07:18:39,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:39,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1152711243, now seen corresponding path program 1 times [2024-11-09 07:18:39,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:18:39,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094526456] [2024-11-09 07:18:39,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:39,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:18:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:40,368 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 07:18:40,368 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:18:40,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094526456] [2024-11-09 07:18:40,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094526456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:40,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:40,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:18:40,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236392290] [2024-11-09 07:18:40,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:40,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:18:40,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:18:40,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:18:40,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:18:40,370 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 9 states, 6 states have (on average 4.833333333333333) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:18:43,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:43,417 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2024-11-09 07:18:43,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:18:43,418 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 4.833333333333333) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2024-11-09 07:18:43,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:43,419 INFO L225 Difference]: With dead ends: 116 [2024-11-09 07:18:43,419 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 07:18:43,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:18:43,419 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 48 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:43,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 359 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-09 07:18:43,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 07:18:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 87. [2024-11-09 07:18:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 82 states have internal predecessors, (90), 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 07:18:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2024-11-09 07:18:43,423 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 42 [2024-11-09 07:18:43,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:43,423 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2024-11-09 07:18:43,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 4.833333333333333) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:18:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2024-11-09 07:18:43,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:18:43,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:43,425 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 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 07:18:43,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 07:18:43,425 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-09 07:18:43,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:43,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1152711242, now seen corresponding path program 1 times [2024-11-09 07:18:43,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:18:43,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493542222] [2024-11-09 07:18:43,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:43,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:18:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:47,026 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:18:47,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:18:47,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493542222] [2024-11-09 07:18:47,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493542222] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:18:47,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803588740] [2024-11-09 07:18:47,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:47,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:18:47,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:18:47,028 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:18:47,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6f1847a-cf0e-436f-acf5-6f925ad0c1c8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 07:18:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:47,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 07:18:47,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:48,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-09 07:18:49,698 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_97| Int)) (and (<= (+ |v_node_create_~temp~0#1.base_97| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_97| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_97|)) |c_#memory_$Pointer$.base|))) is different from true [2024-11-09 07:18:49,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:18:49,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-09 07:18:50,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-09 07:18:50,286 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2024-11-09 07:18:50,286 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:18:50,615 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2555 (Array Int Int)) (|v_node_create_~temp~0#1.base_102| Int)) (or (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_102| v_ArrVal_2555) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_102| 1)))) is different from false [2024-11-09 07:18:50,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803588740] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:18:50,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1949575338] [2024-11-09 07:18:50,626 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2024-11-09 07:18:50,626 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:18:50,627 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:18:50,627 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:18:50,627 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:18:53,364 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2024-11-09 07:18:53,427 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:20:06,850 WARN L286 SmtUtils]: Spent 8.86s on a formula simplification. DAG size of input: 228 DAG size of output: 222 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 07:20:41,261 WARN L286 SmtUtils]: Spent 21.94s on a formula simplification. DAG size of input: 238 DAG size of output: 232 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 07:21:19,167 WARN L286 SmtUtils]: Spent 22.91s on a formula simplification. DAG size of input: 236 DAG size of output: 230 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 07:21:57,637 WARN L286 SmtUtils]: Spent 24.08s on a formula simplification. DAG size of input: 250 DAG size of output: 240 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 07:21:57,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1949575338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:21:57,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:21:57,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [16, 15] total 52 [2024-11-09 07:21:57,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412827956] [2024-11-09 07:21:57,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:21:57,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 07:21:57,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:21:57,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 07:21:57,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2379, Unknown=18, NotChecked=198, Total=2756 [2024-11-09 07:21:57,640 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 28 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 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 07:22:08,178 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 07:22:10,526 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 07:22:13,651 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 07:22:15,919 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 07:22:18,458 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 07:22:21,105 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 07:22:23,463 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 07:22:26,496 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 07:22:29,337 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 07:22:31,624 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 07:22:33,975 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 07:22:37,109 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 07:22:40,063 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 07:22:42,412 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 07:22:44,730 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 07:22:46,741 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 07:22:57,941 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]