./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all.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_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/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_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/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_898abf26-2d3d-4768-bf51-1979e8ec5ab8/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 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:00:17,635 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:00:17,736 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 05:00:17,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:00:17,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:00:17,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:00:17,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:00:17,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:00:17,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:00:17,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:00:17,787 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:00:17,788 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:00:17,789 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:00:17,792 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:00:17,792 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:00:17,793 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:00:17,793 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:00:17,793 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:00:17,794 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:00:17,794 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:00:17,798 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:00:17,798 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:00:17,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 05:00:17,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 05:00:17,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:00:17,800 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:00:17,801 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:00:17,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:00:17,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:00:17,804 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 05:00:17,805 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 05:00:17,805 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 05:00:17,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:00:17,806 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:00:17,806 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:00:17,807 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:00:17,807 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:00:17,807 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:00:17,808 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:00:17,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:00:17,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:00:17,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:00:17,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:00:17,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:00:17,810 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:00:17,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:00:17,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:00:17,811 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:00:17,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:00:17,812 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_898abf26-2d3d-4768-bf51-1979e8ec5ab8/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_898abf26-2d3d-4768-bf51-1979e8ec5ab8/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 -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2024-11-09 05:00:18,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:00:18,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:00:18,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:00:18,263 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:00:18,264 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:00:18,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-simple/dll2c_update_all.i Unable to find full path for "g++" [2024-11-09 05:00:20,395 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:00:20,628 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:00:20,629 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/sv-benchmarks/c/list-simple/dll2c_update_all.i [2024-11-09 05:00:20,645 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/data/49a94bbcd/3afea31c9d6b4019bf17c2da26d5568e/FLAG3bafcfa3f [2024-11-09 05:00:20,667 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/data/49a94bbcd/3afea31c9d6b4019bf17c2da26d5568e [2024-11-09 05:00:20,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:00:20,671 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:00:20,672 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:00:20,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:00:20,680 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:00:20,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:00:20" (1/1) ... [2024-11-09 05:00:20,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d33cbd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:00:20, skipping insertion in model container [2024-11-09 05:00:20,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:00:20" (1/1) ... [2024-11-09 05:00:20,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:00:21,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:00:21,129 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:00:21,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:00:21,243 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:00:21,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:00:21 WrapperNode [2024-11-09 05:00:21,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:00:21,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:00:21,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:00:21,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:00:21,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:00:21" (1/1) ... [2024-11-09 05:00:21,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:00:21" (1/1) ... [2024-11-09 05:00:21,308 INFO L138 Inliner]: procedures = 126, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2024-11-09 05:00:21,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:00:21,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:00:21,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:00:21,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:00:21,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:00:21" (1/1) ... [2024-11-09 05:00:21,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:00:21" (1/1) ... [2024-11-09 05:00:21,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:00:21" (1/1) ... [2024-11-09 05:00:21,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:00:21" (1/1) ... [2024-11-09 05:00:21,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:00:21" (1/1) ... [2024-11-09 05:00:21,350 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:00:21" (1/1) ... [2024-11-09 05:00:21,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:00:21" (1/1) ... [2024-11-09 05:00:21,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:00:21" (1/1) ... [2024-11-09 05:00:21,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:00:21,367 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:00:21,367 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:00:21,367 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:00:21,368 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:00:21" (1/1) ... [2024-11-09 05:00:21,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:00:21,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:00:21,403 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:00:21,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:00:21,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:00:21,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:00:21,463 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 05:00:21,464 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 05:00:21,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 05:00:21,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:00:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 05:00:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 05:00:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:00:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:00:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:00:21,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:00:21,610 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:00:21,612 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:00:21,983 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-11-09 05:00:21,983 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:00:22,041 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:00:22,041 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 05:00:22,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:00:22 BoogieIcfgContainer [2024-11-09 05:00:22,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:00:22,045 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:00:22,045 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:00:22,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:00:22,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:00:20" (1/3) ... [2024-11-09 05:00:22,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77860e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:00:22, skipping insertion in model container [2024-11-09 05:00:22,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:00:21" (2/3) ... [2024-11-09 05:00:22,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77860e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:00:22, skipping insertion in model container [2024-11-09 05:00:22,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:00:22" (3/3) ... [2024-11-09 05:00:22,052 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2024-11-09 05:00:22,070 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:00:22,071 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-11-09 05:00:22,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:00:22,130 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;@671cbdd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:00:22,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2024-11-09 05:00:22,134 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 48 states have (on average 2.0625) internal successors, (99), 82 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:00:22,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 05:00:22,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:22,143 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 05:00:22,144 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:00:22,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:22,152 INFO L85 PathProgramCache]: Analyzing trace with hash 220055383, now seen corresponding path program 1 times [2024-11-09 05:00:22,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:00:22,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676453853] [2024-11-09 05:00:22,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:22,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:00:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:22,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:22,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:00:22,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676453853] [2024-11-09 05:00:22,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676453853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:22,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:22,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:00:22,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183502575] [2024-11-09 05:00:22,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:22,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:00:22,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:00:22,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:00:22,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:00:22,516 INFO L87 Difference]: Start difference. First operand has 86 states, 48 states have (on average 2.0625) internal successors, (99), 82 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 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 05:00:22,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:22,765 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2024-11-09 05:00:22,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:00:22,768 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 05:00:22,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:22,779 INFO L225 Difference]: With dead ends: 82 [2024-11-09 05:00:22,779 INFO L226 Difference]: Without dead ends: 80 [2024-11-09 05:00:22,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:00:22,789 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:22,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 139 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:00:22,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-09 05:00:22,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-09 05:00:22,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 76 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:00:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2024-11-09 05:00:22,864 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 5 [2024-11-09 05:00:22,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:22,864 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2024-11-09 05:00:22,864 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 05:00:22,865 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2024-11-09 05:00:22,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 05:00:22,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:22,865 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 05:00:22,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:00:22,866 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:00:22,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:22,867 INFO L85 PathProgramCache]: Analyzing trace with hash 220055384, now seen corresponding path program 1 times [2024-11-09 05:00:22,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:00:22,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599529259] [2024-11-09 05:00:22,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:22,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:00:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:23,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:23,052 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:00:23,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599529259] [2024-11-09 05:00:23,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599529259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:23,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:23,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:00:23,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659574549] [2024-11-09 05:00:23,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:23,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:00:23,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:00:23,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:00:23,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:00:23,057 INFO L87 Difference]: Start difference. First operand 80 states and 94 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 05:00:23,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:23,154 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2024-11-09 05:00:23,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:00:23,155 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 05:00:23,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:23,156 INFO L225 Difference]: With dead ends: 77 [2024-11-09 05:00:23,156 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 05:00:23,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:00:23,158 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:23,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 142 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:00:23,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 05:00:23,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-09 05:00:23,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.891304347826087) internal successors, (87), 73 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:00:23,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2024-11-09 05:00:23,169 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 91 transitions. Word has length 5 [2024-11-09 05:00:23,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:23,169 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 91 transitions. [2024-11-09 05:00:23,169 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 05:00:23,170 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 91 transitions. [2024-11-09 05:00:23,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 05:00:23,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:23,171 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:00:23,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 05:00:23,171 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:00:23,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:23,173 INFO L85 PathProgramCache]: Analyzing trace with hash -6678087, now seen corresponding path program 1 times [2024-11-09 05:00:23,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:00:23,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892098019] [2024-11-09 05:00:23,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:23,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:00:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:23,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:23,314 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:00:23,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892098019] [2024-11-09 05:00:23,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892098019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:23,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:23,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:00:23,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855742786] [2024-11-09 05:00:23,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:23,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:00:23,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:00:23,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:00:23,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:00:23,319 INFO L87 Difference]: Start difference. First operand 77 states and 91 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 05:00:23,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:23,388 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2024-11-09 05:00:23,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:00:23,389 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 05:00:23,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:23,390 INFO L225 Difference]: With dead ends: 89 [2024-11-09 05:00:23,390 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 05:00:23,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:00:23,392 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 11 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:23,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 152 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:00:23,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 05:00:23,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2024-11-09 05:00:23,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 48 states have (on average 1.8541666666666667) internal successors, (89), 75 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:00:23,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2024-11-09 05:00:23,410 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 11 [2024-11-09 05:00:23,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:23,411 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2024-11-09 05:00:23,411 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 05:00:23,411 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2024-11-09 05:00:23,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 05:00:23,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:23,412 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:00:23,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:00:23,413 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:00:23,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:23,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1439385985, now seen corresponding path program 1 times [2024-11-09 05:00:23,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:00:23,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788922330] [2024-11-09 05:00:23,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:23,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:00:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:23,673 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 05:00:23,673 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:00:23,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788922330] [2024-11-09 05:00:23,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788922330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:23,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:23,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:00:23,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061697158] [2024-11-09 05:00:23,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:23,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:00:23,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:00:23,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:00:23,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:00:23,678 INFO L87 Difference]: Start difference. First operand 79 states and 93 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 05:00:23,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:23,875 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2024-11-09 05:00:23,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:00:23,876 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 05:00:23,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:23,877 INFO L225 Difference]: With dead ends: 78 [2024-11-09 05:00:23,878 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 05:00:23,878 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 05:00:23,879 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 7 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:23,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 284 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:00:23,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 05:00:23,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-09 05:00:23,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.8333333333333333) internal successors, (88), 74 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:00:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2024-11-09 05:00:23,891 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 20 [2024-11-09 05:00:23,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:23,892 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2024-11-09 05:00:23,892 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 05:00:23,892 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2024-11-09 05:00:23,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 05:00:23,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:23,893 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:00:23,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:00:23,894 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:00:23,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:23,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1439385986, now seen corresponding path program 1 times [2024-11-09 05:00:23,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:00:23,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714487879] [2024-11-09 05:00:23,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:23,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:00:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:24,271 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 05:00:24,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:00:24,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714487879] [2024-11-09 05:00:24,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714487879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:24,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:24,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:00:24,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505229133] [2024-11-09 05:00:24,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:24,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:00:24,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:00:24,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:00:24,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:00:24,275 INFO L87 Difference]: Start difference. First operand 78 states and 92 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 05:00:24,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:24,424 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2024-11-09 05:00:24,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:00:24,425 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 05:00:24,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:24,426 INFO L225 Difference]: With dead ends: 77 [2024-11-09 05:00:24,426 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 05:00:24,426 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 05:00:24,427 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 6 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:24,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 304 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:00:24,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 05:00:24,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-09 05:00:24,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.8125) internal successors, (87), 73 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:00:24,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2024-11-09 05:00:24,441 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 91 transitions. Word has length 20 [2024-11-09 05:00:24,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:24,441 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 91 transitions. [2024-11-09 05:00:24,441 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 05:00:24,442 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 91 transitions. [2024-11-09 05:00:24,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 05:00:24,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:24,443 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 05:00:24,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 05:00:24,443 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:00:24,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:24,444 INFO L85 PathProgramCache]: Analyzing trace with hash 270461986, now seen corresponding path program 1 times [2024-11-09 05:00:24,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:00:24,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003760064] [2024-11-09 05:00:24,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:24,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:00:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:24,794 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 05:00:24,795 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:00:24,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003760064] [2024-11-09 05:00:24,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003760064] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:00:24,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216565223] [2024-11-09 05:00:24,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:24,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:00:24,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:00:24,800 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:00:24,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:00:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:24,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 05:00:24,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:25,011 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 05:00:25,065 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 05:00:25,117 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 05:00:25,118 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 05:00:25,150 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 05:00:25,150 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:00:25,429 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 05:00:25,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216565223] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:00:25,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1457250116] [2024-11-09 05:00:25,455 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 05:00:25,455 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:00:25,460 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:00:25,466 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:00:25,468 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:00:26,689 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 05:00:26,737 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:00:28,758 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1042#(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$.base_71| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_71| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_71| |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|)) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (<= 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_~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) (exists ((|v_#memory_$Pointer$.offset_71| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 0)))) (exists ((|v_#memory_int_67| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_67| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_67| |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_~data#1| 1))' at error location [2024-11-09 05:00:28,759 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:00:28,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:00:28,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 11 [2024-11-09 05:00:28,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838490587] [2024-11-09 05:00:28,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:00:28,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 05:00:28,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:00:28,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 05:00:28,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=482, Unknown=2, NotChecked=44, Total=600 [2024-11-09 05:00:28,761 INFO L87 Difference]: Start difference. First operand 77 states and 91 transitions. Second operand has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 05:00:29,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:29,117 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2024-11-09 05:00:29,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:00:29,118 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 22 [2024-11-09 05:00:29,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:29,120 INFO L225 Difference]: With dead ends: 82 [2024-11-09 05:00:29,120 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 05:00:29,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=77, Invalid=525, Unknown=2, NotChecked=46, Total=650 [2024-11-09 05:00:29,124 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 2 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:29,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 470 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 302 Invalid, 0 Unknown, 94 Unchecked, 0.3s Time] [2024-11-09 05:00:29,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 05:00:29,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-09 05:00:29,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 77 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 05:00:29,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2024-11-09 05:00:29,136 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 22 [2024-11-09 05:00:29,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:29,136 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2024-11-09 05:00:29,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 05:00:29,137 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2024-11-09 05:00:29,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 05:00:29,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:29,137 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 05:00:29,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 05:00:29,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:00:29,339 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:00:29,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:29,340 INFO L85 PathProgramCache]: Analyzing trace with hash 270461987, now seen corresponding path program 1 times [2024-11-09 05:00:29,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:00:29,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910485362] [2024-11-09 05:00:29,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:29,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:00:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:29,870 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 05:00:29,870 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:00:29,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910485362] [2024-11-09 05:00:29,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910485362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:00:29,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684663755] [2024-11-09 05:00:29,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:29,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:00:29,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:00:29,873 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:00:29,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 05:00:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:30,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 05:00:30,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:30,010 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 05:00:30,018 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 05:00:30,154 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:00:30,155 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 05:00:30,161 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 05:00:30,195 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 05:00:30,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:00:30,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684663755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:00:30,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [462019642] [2024-11-09 05:00:30,373 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 05:00:30,374 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:00:30,374 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:00:30,375 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:00:30,375 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:00:31,062 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 05:00:31,099 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:00:33,135 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1315#(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_85| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_85| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_85| |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))))) (exists ((|v_#memory_$Pointer$.offset_85| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_85| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_85| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 0)))) (exists ((|v_#memory_int_81| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_81| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_81| |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))))) (= 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) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |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) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-09 05:00:33,135 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:00:33,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:00:33,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2024-11-09 05:00:33,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647932283] [2024-11-09 05:00:33,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:00:33,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 05:00:33,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:00:33,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 05:00:33,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=670, Unknown=1, NotChecked=0, Total=756 [2024-11-09 05:00:33,138 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 05:00:33,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:33,531 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2024-11-09 05:00:33,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:00:33,531 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-09 05:00:33,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:33,532 INFO L225 Difference]: With dead ends: 82 [2024-11-09 05:00:33,532 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 05:00:33,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=96, Invalid=773, Unknown=1, NotChecked=0, Total=870 [2024-11-09 05:00:33,534 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:33,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:00:33,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 05:00:33,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-09 05:00:33,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 77 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 05:00:33,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2024-11-09 05:00:33,541 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 22 [2024-11-09 05:00:33,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:33,541 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2024-11-09 05:00:33,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 05:00:33,542 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2024-11-09 05:00:33,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 05:00:33,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:33,543 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 05:00:33,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 05:00:33,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:00:33,747 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:00:33,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:33,749 INFO L85 PathProgramCache]: Analyzing trace with hash -2078881787, now seen corresponding path program 1 times [2024-11-09 05:00:33,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:00:33,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229146851] [2024-11-09 05:00:33,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:33,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:00:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:33,859 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 05:00:33,860 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:00:33,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229146851] [2024-11-09 05:00:33,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229146851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:00:33,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643739098] [2024-11-09 05:00:33,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:33,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:00:33,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:00:33,862 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:00:33,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 05:00:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:33,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 05:00:33,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:34,018 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 05:00:34,019 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:00:34,054 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 05:00:34,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643739098] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:00:34,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1967628161] [2024-11-09 05:00:34,057 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 05:00:34,057 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:00:34,057 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:00:34,058 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:00:34,058 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:00:34,938 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 05:00:34,969 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:00:40,718 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1640#(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_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-09 05:00:40,719 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:00:40,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:00:40,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-09 05:00:40,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620390810] [2024-11-09 05:00:40,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:00:40,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:00:40,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:00:40,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:00:40,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=354, Unknown=3, NotChecked=0, Total=420 [2024-11-09 05:00:40,721 INFO L87 Difference]: Start difference. First operand 82 states and 98 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 05:00:40,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:40,837 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2024-11-09 05:00:40,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:00:40,837 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 05:00:40,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:40,838 INFO L225 Difference]: With dead ends: 82 [2024-11-09 05:00:40,838 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 05:00:40,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=63, Invalid=354, Unknown=3, NotChecked=0, Total=420 [2024-11-09 05:00:40,840 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 1 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:40,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 351 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:00:40,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 05:00:40,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-09 05:00:40,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.75) internal successors, (91), 77 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 05:00:40,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2024-11-09 05:00:40,849 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 24 [2024-11-09 05:00:40,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:40,849 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2024-11-09 05:00:40,850 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 05:00:40,850 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2024-11-09 05:00:40,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 05:00:40,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:40,850 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 05:00:40,871 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 05:00:41,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:00:41,051 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:00:41,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:41,052 INFO L85 PathProgramCache]: Analyzing trace with hash -25624290, now seen corresponding path program 1 times [2024-11-09 05:00:41,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:00:41,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814866126] [2024-11-09 05:00:41,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:41,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:00:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:41,188 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 05:00:41,189 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:00:41,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814866126] [2024-11-09 05:00:41,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814866126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:00:41,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693613033] [2024-11-09 05:00:41,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:41,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:00:41,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:00:41,192 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:00:41,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 05:00:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:41,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 05:00:41,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:41,351 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 05:00:41,425 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 05:00:41,473 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 05:00:41,473 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 05:00:41,490 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 05:00:41,490 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:00:41,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693613033] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:00:41,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1932941770] [2024-11-09 05:00:41,575 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 05:00:41,575 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:00:41,575 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:00:41,576 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:00:41,576 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:00:42,427 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 05:00:42,472 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:00:50,838 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1926#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_21| Int)) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_21|) 1))) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-09 05:00:50,838 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:00:50,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:00:50,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2024-11-09 05:00:50,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525310057] [2024-11-09 05:00:50,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:00:50,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 05:00:50,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:00:50,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 05:00:50,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=4, NotChecked=48, Total=702 [2024-11-09 05:00:50,840 INFO L87 Difference]: Start difference. First operand 82 states and 97 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 05:00:51,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:51,147 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2024-11-09 05:00:51,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:00:51,148 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 05:00:51,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:51,148 INFO L225 Difference]: With dead ends: 81 [2024-11-09 05:00:51,149 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 05:00:51,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=97, Invalid=715, Unknown=4, NotChecked=54, Total=870 [2024-11-09 05:00:51,150 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 10 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:51,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 363 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 227 Invalid, 0 Unknown, 91 Unchecked, 0.2s Time] [2024-11-09 05:00:51,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 05:00:51,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-09 05:00:51,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.7307692307692308) internal successors, (90), 76 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 05:00:51,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2024-11-09 05:00:51,167 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 25 [2024-11-09 05:00:51,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:51,167 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2024-11-09 05:00:51,168 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 05:00:51,168 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2024-11-09 05:00:51,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 05:00:51,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:51,168 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 05:00:51,195 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 05:00:51,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:00:51,369 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:00:51,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:51,370 INFO L85 PathProgramCache]: Analyzing trace with hash -25624289, now seen corresponding path program 1 times [2024-11-09 05:00:51,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:00:51,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353283396] [2024-11-09 05:00:51,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:51,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:00:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:51,637 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 05:00:51,638 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:00:51,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353283396] [2024-11-09 05:00:51,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353283396] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:00:51,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151595290] [2024-11-09 05:00:51,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:51,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:00:51,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:00:51,640 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:00:51,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 05:00:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:51,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 05:00:51,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:51,787 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 05:00:51,792 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 05:00:51,933 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 05:00:51,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:00:51,961 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 05:00:51,974 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:00:51,975 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 05:00:52,023 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 05:00:52,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:00:52,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151595290] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:00:52,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1921868958] [2024-11-09 05:00:52,174 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 05:00:52,174 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:00:52,175 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:00:52,175 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:00:52,175 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:00:53,073 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 05:00:53,106 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:00:55,284 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2223#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_22| Int)) (<= (select |#length| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_22|) 3)) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-09 05:00:55,284 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:00:55,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:00:55,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-09 05:00:55,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292812011] [2024-11-09 05:00:55,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:00:55,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 05:00:55,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:00:55,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 05:00:55,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=882, Unknown=2, NotChecked=60, Total=1056 [2024-11-09 05:00:55,291 INFO L87 Difference]: Start difference. First operand 81 states and 96 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 05:00:55,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:55,673 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2024-11-09 05:00:55,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 05:00:55,673 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 05:00:55,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:55,675 INFO L225 Difference]: With dead ends: 100 [2024-11-09 05:00:55,676 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 05:00:55,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=139, Invalid=1123, Unknown=2, NotChecked=68, Total=1332 [2024-11-09 05:00:55,677 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 20 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:55,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 478 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 228 Invalid, 0 Unknown, 117 Unchecked, 0.2s Time] [2024-11-09 05:00:55,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 05:00:55,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2024-11-09 05:00:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 63 states have (on average 1.7142857142857142) internal successors, (108), 87 states have internal predecessors, (108), 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 05:00:55,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2024-11-09 05:00:55,683 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 25 [2024-11-09 05:00:55,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:55,683 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2024-11-09 05:00:55,683 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 05:00:55,684 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2024-11-09 05:00:55,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 05:00:55,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:55,684 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 05:00:55,706 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 05:00:55,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:00:55,888 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:00:55,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:55,889 INFO L85 PathProgramCache]: Analyzing trace with hash -794352985, now seen corresponding path program 1 times [2024-11-09 05:00:55,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:00:55,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895744188] [2024-11-09 05:00:55,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:55,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:00:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:56,054 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 05:00:56,054 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:00:56,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895744188] [2024-11-09 05:00:56,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895744188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:56,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:56,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:00:56,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103567982] [2024-11-09 05:00:56,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:56,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:00:56,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:00:56,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:00:56,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:00:56,059 INFO L87 Difference]: Start difference. First operand 93 states and 116 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 05:00:56,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:56,204 INFO L93 Difference]: Finished difference Result 92 states and 115 transitions. [2024-11-09 05:00:56,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:00:56,204 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 05:00:56,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:56,205 INFO L225 Difference]: With dead ends: 92 [2024-11-09 05:00:56,205 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 05:00:56,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:00:56,206 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 8 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:56,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 334 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:00:56,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 05:00:56,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 05:00:56,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.6984126984126984) internal successors, (107), 86 states have internal predecessors, (107), 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 05:00:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2024-11-09 05:00:56,212 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 26 [2024-11-09 05:00:56,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:56,212 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2024-11-09 05:00:56,212 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 05:00:56,212 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2024-11-09 05:00:56,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 05:00:56,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:56,213 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 05:00:56,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 05:00:56,214 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:00:56,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:56,214 INFO L85 PathProgramCache]: Analyzing trace with hash -794352984, now seen corresponding path program 1 times [2024-11-09 05:00:56,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:00:56,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911751540] [2024-11-09 05:00:56,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:56,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:00:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:56,457 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 05:00:56,457 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:00:56,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911751540] [2024-11-09 05:00:56,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911751540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:56,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:56,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:00:56,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647891210] [2024-11-09 05:00:56,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:56,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:00:56,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:00:56,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:00:56,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:00:56,460 INFO L87 Difference]: Start difference. First operand 92 states and 115 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 05:00:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:56,614 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2024-11-09 05:00:56,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:00:56,615 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 05:00:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:56,615 INFO L225 Difference]: With dead ends: 91 [2024-11-09 05:00:56,615 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 05:00:56,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:00:56,616 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 7 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:56,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 354 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:00:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 05:00:56,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-09 05:00:56,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.6825396825396826) internal successors, (106), 85 states have internal predecessors, (106), 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 05:00:56,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2024-11-09 05:00:56,621 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 114 transitions. Word has length 26 [2024-11-09 05:00:56,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:56,622 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 114 transitions. [2024-11-09 05:00:56,622 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 05:00:56,622 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2024-11-09 05:00:56,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 05:00:56,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:56,623 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:00:56,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 05:00:56,624 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:00:56,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:56,624 INFO L85 PathProgramCache]: Analyzing trace with hash 378750483, now seen corresponding path program 1 times [2024-11-09 05:00:56,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:00:56,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874449158] [2024-11-09 05:00:56,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:56,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:00:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:56,794 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 05:00:56,795 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:00:56,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874449158] [2024-11-09 05:00:56,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874449158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:56,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:56,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 05:00:56,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555689601] [2024-11-09 05:00:56,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:56,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:00:56,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:00:56,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:00:56,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:00:56,797 INFO L87 Difference]: Start difference. First operand 91 states and 114 transitions. Second operand has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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 05:00:57,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:57,001 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2024-11-09 05:00:57,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:00:57,002 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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 30 [2024-11-09 05:00:57,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:57,002 INFO L225 Difference]: With dead ends: 95 [2024-11-09 05:00:57,002 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 05:00:57,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-09 05:00:57,003 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 51 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:57,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 380 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:00:57,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 05:00:57,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-09 05:00:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.7014925373134329) internal successors, (114), 89 states have internal predecessors, (114), 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 05:00:57,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 122 transitions. [2024-11-09 05:00:57,008 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 122 transitions. Word has length 30 [2024-11-09 05:00:57,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:57,008 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 122 transitions. [2024-11-09 05:00:57,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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 05:00:57,009 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2024-11-09 05:00:57,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 05:00:57,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:57,010 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:00:57,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 05:00:57,010 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:00:57,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:57,011 INFO L85 PathProgramCache]: Analyzing trace with hash 378750484, now seen corresponding path program 1 times [2024-11-09 05:00:57,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:00:57,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964691659] [2024-11-09 05:00:57,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:57,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:00:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:57,345 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 05:00:57,346 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:00:57,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964691659] [2024-11-09 05:00:57,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964691659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:57,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:57,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 05:00:57,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397845052] [2024-11-09 05:00:57,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:57,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:00:57,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:00:57,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:00:57,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:00:57,348 INFO L87 Difference]: Start difference. First operand 95 states and 122 transitions. Second operand has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 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 05:00:57,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:57,572 INFO L93 Difference]: Finished difference Result 95 states and 120 transitions. [2024-11-09 05:00:57,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:00:57,573 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 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 30 [2024-11-09 05:00:57,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:57,573 INFO L225 Difference]: With dead ends: 95 [2024-11-09 05:00:57,573 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 05:00:57,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-09 05:00:57,574 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 48 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:57,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 420 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:00:57,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 05:00:57,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-09 05:00:57,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.671641791044776) internal successors, (112), 89 states have internal predecessors, (112), 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 05:00:57,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 120 transitions. [2024-11-09 05:00:57,580 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 120 transitions. Word has length 30 [2024-11-09 05:00:57,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:57,581 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 120 transitions. [2024-11-09 05:00:57,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 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 05:00:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 120 transitions. [2024-11-09 05:00:57,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 05:00:57,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:57,586 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:00:57,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 05:00:57,587 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:00:57,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:57,588 INFO L85 PathProgramCache]: Analyzing trace with hash -266822863, now seen corresponding path program 1 times [2024-11-09 05:00:57,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:00:57,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560833994] [2024-11-09 05:00:57,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:57,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:00:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:57,776 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 05:00:57,776 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:00:57,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560833994] [2024-11-09 05:00:57,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560833994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:57,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:57,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 05:00:57,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540604930] [2024-11-09 05:00:57,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:57,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:00:57,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:00:57,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:00:57,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:00:57,779 INFO L87 Difference]: Start difference. First operand 95 states and 120 transitions. Second operand has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 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 05:00:58,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:58,024 INFO L93 Difference]: Finished difference Result 109 states and 137 transitions. [2024-11-09 05:00:58,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:00:58,024 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 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 32 [2024-11-09 05:00:58,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:58,025 INFO L225 Difference]: With dead ends: 109 [2024-11-09 05:00:58,025 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 05:00:58,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:00:58,026 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 54 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:58,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 316 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:00:58,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 05:00:58,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2024-11-09 05:00:58,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.6666666666666667) internal successors, (120), 93 states have internal predecessors, (120), 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 05:00:58,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 128 transitions. [2024-11-09 05:00:58,030 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 128 transitions. Word has length 32 [2024-11-09 05:00:58,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:58,031 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 128 transitions. [2024-11-09 05:00:58,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 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 05:00:58,031 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 128 transitions. [2024-11-09 05:00:58,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 05:00:58,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:58,032 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:00:58,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 05:00:58,033 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:00:58,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:58,033 INFO L85 PathProgramCache]: Analyzing trace with hash -266822862, now seen corresponding path program 1 times [2024-11-09 05:00:58,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:00:58,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927342403] [2024-11-09 05:00:58,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:58,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:00:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:58,139 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 05:00:58,139 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:00:58,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927342403] [2024-11-09 05:00:58,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927342403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:00:58,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431425968] [2024-11-09 05:00:58,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:58,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:00:58,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:00:58,143 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:00:58,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 05:00:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:58,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:00:58,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 05:00:58,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:00:58,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431425968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:58,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:00:58,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-09 05:00:58,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433316989] [2024-11-09 05:00:58,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:58,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:00:58,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:00:58,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:00:58,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:00:58,341 INFO L87 Difference]: Start difference. First operand 99 states and 128 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:00:58,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:58,398 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2024-11-09 05:00:58,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:00:58,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-09 05:00:58,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:58,400 INFO L225 Difference]: With dead ends: 127 [2024-11-09 05:00:58,400 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 05:00:58,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:00:58,401 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 90 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:58,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 129 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:00:58,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 05:00:58,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 103. [2024-11-09 05:00:58,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 76 states have (on average 1.631578947368421) internal successors, (124), 97 states have internal predecessors, (124), 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 05:00:58,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 132 transitions. [2024-11-09 05:00:58,406 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 132 transitions. Word has length 32 [2024-11-09 05:00:58,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:58,407 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 132 transitions. [2024-11-09 05:00:58,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:00:58,407 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 132 transitions. [2024-11-09 05:00:58,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 05:00:58,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:58,409 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:00:58,429 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 05:00:58,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 05:00:58,610 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:00:58,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:58,611 INFO L85 PathProgramCache]: Analyzing trace with hash 466323706, now seen corresponding path program 1 times [2024-11-09 05:00:58,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:00:58,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565186242] [2024-11-09 05:00:58,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:58,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:00:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:58,704 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 05:00:58,704 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:00:58,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565186242] [2024-11-09 05:00:58,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565186242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:58,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:58,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:00:58,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084345352] [2024-11-09 05:00:58,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:58,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:00:58,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:00:58,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:00:58,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:00:58,707 INFO L87 Difference]: Start difference. First operand 103 states and 132 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:00:58,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:58,769 INFO L93 Difference]: Finished difference Result 117 states and 148 transitions. [2024-11-09 05:00:58,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:00:58,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-11-09 05:00:58,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:58,771 INFO L225 Difference]: With dead ends: 117 [2024-11-09 05:00:58,771 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 05:00:58,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:00:58,772 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 17 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:58,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 200 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:00:58,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 05:00:58,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 104. [2024-11-09 05:00:58,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 77 states have (on average 1.6233766233766234) internal successors, (125), 98 states have internal predecessors, (125), 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 05:00:58,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 133 transitions. [2024-11-09 05:00:58,778 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 133 transitions. Word has length 33 [2024-11-09 05:00:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:58,779 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 133 transitions. [2024-11-09 05:00:58,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:00:58,779 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2024-11-09 05:00:58,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 05:00:58,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:58,780 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 05:00:58,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 05:00:58,780 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:00:58,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:58,780 INFO L85 PathProgramCache]: Analyzing trace with hash 265282461, now seen corresponding path program 1 times [2024-11-09 05:00:58,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:00:58,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359865786] [2024-11-09 05:00:58,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:58,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:00:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:58,882 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 05:00:58,882 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:00:58,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359865786] [2024-11-09 05:00:58,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359865786] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:00:58,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881008673] [2024-11-09 05:00:58,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:58,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:00:58,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:00:58,885 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:00:58,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 05:00:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:59,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:00:59,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:59,095 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 05:00:59,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:00:59,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881008673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:59,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:00:59,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-09 05:00:59,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063733760] [2024-11-09 05:00:59,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:59,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:00:59,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:00:59,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:00:59,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:00:59,097 INFO L87 Difference]: Start difference. First operand 104 states and 133 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 05:00:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:59,141 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2024-11-09 05:00:59,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:00:59,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 36 [2024-11-09 05:00:59,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:59,143 INFO L225 Difference]: With dead ends: 83 [2024-11-09 05:00:59,143 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 05:00:59,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:00:59,144 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:59,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 189 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:00:59,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 05:00:59,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-09 05:00:59,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 79 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:00:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2024-11-09 05:00:59,147 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 36 [2024-11-09 05:00:59,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:59,148 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2024-11-09 05:00:59,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 05:00:59,148 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2024-11-09 05:00:59,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 05:00:59,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:59,149 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:00:59,170 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 05:00:59,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:00:59,350 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:00:59,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:59,351 INFO L85 PathProgramCache]: Analyzing trace with hash -644107361, now seen corresponding path program 1 times [2024-11-09 05:00:59,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:00:59,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128712996] [2024-11-09 05:00:59,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:59,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:00:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:59,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 05:00:59,556 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:00:59,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128712996] [2024-11-09 05:00:59,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128712996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:59,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:59,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 05:00:59,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470282353] [2024-11-09 05:00:59,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:59,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:00:59,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:00:59,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:00:59,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:00:59,559 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 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 05:00:59,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:59,758 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2024-11-09 05:00:59,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:00:59,759 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 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 36 [2024-11-09 05:00:59,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:59,760 INFO L225 Difference]: With dead ends: 87 [2024-11-09 05:00:59,760 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 05:00:59,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-09 05:00:59,761 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 38 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:59,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 337 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:00:59,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 05:00:59,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-09 05:00:59,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.6) internal successors, (104), 83 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:00:59,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2024-11-09 05:00:59,764 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 36 [2024-11-09 05:00:59,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:59,765 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2024-11-09 05:00:59,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 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 05:00:59,765 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2024-11-09 05:00:59,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 05:00:59,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:59,766 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:00:59,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 05:00:59,766 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:00:59,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:59,767 INFO L85 PathProgramCache]: Analyzing trace with hash -644107360, now seen corresponding path program 1 times [2024-11-09 05:00:59,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:00:59,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587021706] [2024-11-09 05:00:59,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:59,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:00:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 05:00:59,905 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:00:59,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587021706] [2024-11-09 05:00:59,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587021706] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:00:59,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696708265] [2024-11-09 05:00:59,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:59,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:00:59,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:00:59,908 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:00:59,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 05:01:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:00,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:01:00,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:01:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 05:01:00,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:01:00,226 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 05:01:00,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696708265] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:01:00,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [601742099] [2024-11-09 05:01:00,229 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2024-11-09 05:01:00,229 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:01:00,229 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:01:00,229 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:01:00,230 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:01:01,170 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 05:01:01,196 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:01:04,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [601742099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:01:04,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:01:04,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [6, 5, 5] total 28 [2024-11-09 05:01:04,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298442991] [2024-11-09 05:01:04,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:01:04,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 05:01:04,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:01:04,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 05:01:04,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=634, Unknown=1, NotChecked=0, Total=756 [2024-11-09 05:01:04,013 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand has 21 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:01:05,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:01:08,821 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 05:01:12,142 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 05:01:13,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:13,859 INFO L93 Difference]: Finished difference Result 101 states and 126 transitions. [2024-11-09 05:01:13,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 05:01:13,860 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2024-11-09 05:01:13,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:13,861 INFO L225 Difference]: With dead ends: 101 [2024-11-09 05:01:13,861 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 05:01:13,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=121, Invalid=634, Unknown=1, NotChecked=0, Total=756 [2024-11-09 05:01:13,862 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 12 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 3 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:13,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 361 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 743 Invalid, 6 Unknown, 0 Unchecked, 9.8s Time] [2024-11-09 05:01:13,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 05:01:13,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 92. [2024-11-09 05:01:13,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 88 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:01:13,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2024-11-09 05:01:13,866 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 36 [2024-11-09 05:01:13,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:13,866 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2024-11-09 05:01:13,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:01:13,867 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2024-11-09 05:01:13,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 05:01:13,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:13,868 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:01:13,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 05:01:14,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:01:14,069 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:01:14,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:14,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1687748208, now seen corresponding path program 1 times [2024-11-09 05:01:14,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:01:14,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014508288] [2024-11-09 05:01:14,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:14,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:01:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:15,224 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:01:15,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014508288] [2024-11-09 05:01:15,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014508288] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:01:15,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911817556] [2024-11-09 05:01:15,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:15,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:01:15,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:01:15,226 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:01:15,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 05:01:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:15,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-09 05:01:15,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:01:15,456 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 05:01:15,561 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:01:15,562 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 05:01:15,639 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 11 treesize of output 7 [2024-11-09 05:01:15,690 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:01:15,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2024-11-09 05:01:15,776 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 05:01:15,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-09 05:01:15,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-09 05:01:15,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:01:15,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:01:15,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:01:15,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 29 [2024-11-09 05:01:16,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:01:16,087 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 16 [2024-11-09 05:01:16,093 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 05:01:16,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:01:16,125 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1621 (Array Int Int))) (or (not (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_1621 .cse0))) v_ArrVal_1621)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_1621) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1))) is different from false [2024-11-09 05:01:16,272 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-11-09 05:01:16,272 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 19 treesize of output 18 [2024-11-09 05:01:16,357 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1619 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1619) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2024-11-09 05:01:16,365 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1619 (Array Int Int)) (v_ArrVal_1618 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1618) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1619) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) is different from false [2024-11-09 05:01:16,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:01:16,379 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-11-09 05:01:16,386 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 122 treesize of output 110 [2024-11-09 05:01:16,396 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 24 treesize of output 20 [2024-11-09 05:01:16,408 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 05:01:16,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911817556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:01:16,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [750781941] [2024-11-09 05:01:16,536 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-09 05:01:16,536 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:01:16,536 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:01:16,536 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:01:16,537 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:01:17,734 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 05:01:17,766 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:01:22,974 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5092#(and (or (and (= 3 |ULTIMATE.start_dll_circular_update_at_~data#1|) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (and (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (= 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (exists ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.base_33| Int)) (and (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_update_at_~head#1.base_33|) 1)) (or (and (= 3 |ULTIMATE.start_dll_circular_update_at_~data#1|) (<= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (exists ((|v_#memory_int_193| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_204| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_197| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_202| (Array Int (Array Int Int))) (|v_#memory_int_194| (Array Int (Array Int Int))) (|v_#memory_int_195| (Array Int (Array Int Int)))) (and (<= 4 (select |#length| (select (select |v_#memory_$Pointer$.base_204| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= |v_#memory_int_195| (store |v_#memory_int_194| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_int_194| |ULTIMATE.start_main_~s~0#1.base|) 4 (select (select |v_#memory_int_195| |ULTIMATE.start_main_~s~0#1.base|) 4)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_197| (select (select |v_#memory_$Pointer$.base_204| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_197| (select (select |v_#memory_$Pointer$.base_204| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 0)) |ULTIMATE.start_main_~s~0#1.base| (store (store (select (store |v_#memory_$Pointer$.offset_197| (select (select |v_#memory_$Pointer$.base_204| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_197| (select (select |v_#memory_$Pointer$.base_204| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 0)) |ULTIMATE.start_main_~s~0#1.base|) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 8)))) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_204| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= (store |v_#memory_int_193| (select (select |v_#memory_$Pointer$.base_204| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_int_193| (select (select |v_#memory_$Pointer$.base_204| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 (select (select |v_#memory_int_194| (select (select |v_#memory_$Pointer$.base_204| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0))) |v_#memory_int_194|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_204| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_$Pointer$.base_204| |ULTIMATE.start_main_~s~0#1.base|) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 8)))) (= (store (store |v_#memory_$Pointer$.base_202| (select (select |v_#memory_$Pointer$.base_204| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_202| (select (select |v_#memory_$Pointer$.base_204| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 |ULTIMATE.start_main_~s~0#1.base|)) |ULTIMATE.start_main_~s~0#1.base| (store (select (store |v_#memory_$Pointer$.base_202| (select (select |v_#memory_$Pointer$.base_204| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_202| (select (select |v_#memory_$Pointer$.base_204| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 |ULTIMATE.start_main_~s~0#1.base|)) |ULTIMATE.start_main_~s~0#1.base|) 4 (select (select |v_#memory_$Pointer$.base_204| |ULTIMATE.start_main_~s~0#1.base|) 4))) |v_#memory_$Pointer$.base_204|) (= |#memory_int| (store |v_#memory_int_195| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_int_195| |ULTIMATE.start_main_~s~0#1.base|) 8 2))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0) |v_ULTIMATE.start_dll_circular_update_at_~head#1.base_33|)) (and (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.base_33| |ULTIMATE.start_main_~s~0#1.base|) (= 2 |ULTIMATE.start_dll_circular_update_at_~data#1|))))))' at error location [2024-11-09 05:01:22,975 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:01:22,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:01:22,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 30 [2024-11-09 05:01:22,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032362625] [2024-11-09 05:01:22,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:01:22,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 05:01:22,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:01:22,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 05:01:22,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2898, Unknown=15, NotChecked=330, Total=3422 [2024-11-09 05:01:22,978 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 31 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 05:01:23,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:23,904 INFO L93 Difference]: Finished difference Result 105 states and 134 transitions. [2024-11-09 05:01:23,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 05:01:23,904 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-09 05:01:23,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:23,905 INFO L225 Difference]: With dead ends: 105 [2024-11-09 05:01:23,905 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 05:01:23,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=227, Invalid=3676, Unknown=15, NotChecked=372, Total=4290 [2024-11-09 05:01:23,907 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 57 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:23,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1258 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 05:01:23,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 05:01:23,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2024-11-09 05:01:23,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.6) internal successors, (120), 93 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:01:23,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 124 transitions. [2024-11-09 05:01:23,918 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 124 transitions. Word has length 37 [2024-11-09 05:01:23,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:23,919 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 124 transitions. [2024-11-09 05:01:23,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 05:01:23,921 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 124 transitions. [2024-11-09 05:01:23,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 05:01:23,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:23,922 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:01:23,947 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 05:01:24,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:01:24,127 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:01:24,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:24,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1687748209, now seen corresponding path program 1 times [2024-11-09 05:01:24,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:01:24,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194166585] [2024-11-09 05:01:24,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:24,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:01:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:25,796 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:25,796 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:01:25,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194166585] [2024-11-09 05:01:25,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194166585] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:01:25,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613676070] [2024-11-09 05:01:25,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:25,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:01:25,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:01:25,799 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:01:25,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 05:01:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:26,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-09 05:01:26,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:01:26,036 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 05:01:26,043 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 05:01:26,411 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 05:01:26,411 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 05:01:26,432 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:01:26,433 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 05:01:26,575 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 11 treesize of output 7 [2024-11-09 05:01:26,583 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 15 treesize of output 1 [2024-11-09 05:01:26,670 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 05:01:26,677 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 23 treesize of output 16 [2024-11-09 05:01:26,835 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 05:01:26,843 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 23 treesize of output 16 [2024-11-09 05:01:26,918 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 35 treesize of output 26 [2024-11-09 05:01:26,933 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 40 treesize of output 20 [2024-11-09 05:01:27,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:01:27,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:01:27,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 29 [2024-11-09 05:01:27,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:01:27,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:01:27,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 26 [2024-11-09 05:01:27,375 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-09 05:01:27,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:01:27,384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2024-11-09 05:01:27,453 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 05:01:27,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:01:27,711 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_1774 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_1774) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 9)) (not (= (store .cse0 .cse1 (select v_ArrVal_1774 .cse1)) v_ArrVal_1774)))) (forall ((v_ArrVal_1773 (Array Int Int))) (or (not (= v_ArrVal_1773 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_1773 .cse1)))) (forall ((v_ArrVal_1774 (Array Int Int))) (or (< (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_1774) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_1773) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= (store .cse0 .cse1 (select v_ArrVal_1774 .cse1)) v_ArrVal_1774)))))))) is different from false [2024-11-09 05:01:28,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:01:28,447 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-11-09 05:01:28,453 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 138 treesize of output 126 [2024-11-09 05:01:28,462 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 27 treesize of output 25 [2024-11-09 05:01:28,471 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 24 treesize of output 20 [2024-11-09 05:01:28,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:01:28,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2024-11-09 05:01:28,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:01:28,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-09 05:01:28,511 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:01:28,512 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:01:28,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 30 treesize of output 22 [2024-11-09 05:01:28,520 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:01:28,524 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:01:28,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 12 [2024-11-09 05:01:28,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613676070] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:01:28,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1897225028] [2024-11-09 05:01:28,844 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-09 05:01:28,844 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:01:28,844 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:01:28,845 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:01:28,845 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:01:32,803 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 05:01:32,829 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:01:39,097 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5547#(exists ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.base_45| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_41| Int)) (and (or (< (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_41| 8) 0) (< (select |#length| |v_ULTIMATE.start_dll_circular_update_at_~head#1.base_45|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_41| 12))) (or (and (<= 1 |#StackHeapBarrier|) (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_41| 0) (= 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (= 3 |ULTIMATE.start_dll_circular_update_at_~data#1|) (<= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_41|) (exists ((|v_#memory_$Pointer$.offset_229| (Array Int (Array Int Int))) (|v_#memory_int_220| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_236| (Array Int (Array Int Int))) (|v_#memory_int_221| (Array Int (Array Int Int))) (|v_#memory_int_222| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_234| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_221| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_int_221| |ULTIMATE.start_main_~s~0#1.base|) 4 (select (select |v_#memory_int_222| |ULTIMATE.start_main_~s~0#1.base|) 4))) |v_#memory_int_222|) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_229| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_229| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 0)) |ULTIMATE.start_main_~s~0#1.base| (store (store (select (store |v_#memory_$Pointer$.offset_229| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_229| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 0)) |ULTIMATE.start_main_~s~0#1.base|) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 8)))) (= (store (store |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 |ULTIMATE.start_main_~s~0#1.base|)) |ULTIMATE.start_main_~s~0#1.base| (store (select (store |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_234| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 |ULTIMATE.start_main_~s~0#1.base|)) |ULTIMATE.start_main_~s~0#1.base|) 4 (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4))) |v_#memory_$Pointer$.base_236|) (= (store |v_#memory_int_222| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_int_222| |ULTIMATE.start_main_~s~0#1.base|) 8 2)) |#memory_int|) (= (store |v_#memory_int_220| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_int_220| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 (select (select |v_#memory_int_221| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0))) |v_#memory_int_221|) (= (store |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 8))) |#memory_$Pointer$.base|) (<= 4 (select |#length| (select (select |v_#memory_$Pointer$.base_236| |ULTIMATE.start_main_~s~0#1.base|) 4))))) (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0) |v_ULTIMATE.start_dll_circular_update_at_~head#1.base_45|)) (and (= |ULTIMATE.start_main_~i~0#1| 0) (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.base_45| |ULTIMATE.start_main_~s~0#1.base|)))))' at error location [2024-11-09 05:01:39,097 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:01:39,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:01:39,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2024-11-09 05:01:39,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783355333] [2024-11-09 05:01:39,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:01:39,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-09 05:01:39,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:01:39,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-09 05:01:39,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=4463, Unknown=5, NotChecked=134, Total=4830 [2024-11-09 05:01:39,100 INFO L87 Difference]: Start difference. First operand 97 states and 124 transitions. Second operand has 37 states, 32 states have (on average 2.0) internal successors, (64), 32 states have internal predecessors, (64), 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 05:01:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:41,039 INFO L93 Difference]: Finished difference Result 137 states and 180 transitions. [2024-11-09 05:01:41,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 05:01:41,040 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 32 states have (on average 2.0) internal successors, (64), 32 states have internal predecessors, (64), 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 37 [2024-11-09 05:01:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:41,041 INFO L225 Difference]: With dead ends: 137 [2024-11-09 05:01:41,041 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 05:01:41,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=319, Invalid=6160, Unknown=5, NotChecked=158, Total=6642 [2024-11-09 05:01:41,046 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 95 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:41,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1416 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 05:01:41,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 05:01:41,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 105. [2024-11-09 05:01:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.6144578313253013) internal successors, (134), 101 states have internal predecessors, (134), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:01:41,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 138 transitions. [2024-11-09 05:01:41,059 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 138 transitions. Word has length 37 [2024-11-09 05:01:41,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:41,060 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 138 transitions. [2024-11-09 05:01:41,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 32 states have (on average 2.0) internal successors, (64), 32 states have internal predecessors, (64), 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 05:01:41,060 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 138 transitions. [2024-11-09 05:01:41,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 05:01:41,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:41,061 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:01:41,085 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 05:01:41,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:01:41,262 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:01:41,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:41,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1485498499, now seen corresponding path program 2 times [2024-11-09 05:01:41,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:01:41,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427812615] [2024-11-09 05:01:41,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:41,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:01:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 05:01:41,404 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:01:41,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427812615] [2024-11-09 05:01:41,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427812615] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:01:41,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703502961] [2024-11-09 05:01:41,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 05:01:41,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:01:41,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:01:41,407 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:01:41,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 05:01:42,426 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 05:01:42,426 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:01:42,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 05:01:42,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:01:42,466 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 05:01:42,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:01:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 05:01:42,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703502961] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:01:42,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [244388580] [2024-11-09 05:01:42,525 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-09 05:01:42,525 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:01:42,525 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:01:42,526 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:01:42,526 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:01:43,586 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 05:01:43,606 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:01:47,272 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6076#(and (exists ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.base_56| Int)) (and (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_update_at_~head#1.base_56|) 1)) (or (and (<= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (exists ((|v_#memory_$Pointer$.base_262| (Array Int (Array Int Int))) (|v_#memory_int_248| (Array Int (Array Int Int))) (|v_#memory_int_249| (Array Int (Array Int Int))) (|v_#memory_int_250| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_264| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_257| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_250| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_int_250| |ULTIMATE.start_main_~s~0#1.base|) 8 2))) (= (store (store |v_#memory_$Pointer$.base_262| (select (select |v_#memory_$Pointer$.base_264| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_262| (select (select |v_#memory_$Pointer$.base_264| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 |ULTIMATE.start_main_~s~0#1.base|)) |ULTIMATE.start_main_~s~0#1.base| (store (select (store |v_#memory_$Pointer$.base_262| (select (select |v_#memory_$Pointer$.base_264| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_262| (select (select |v_#memory_$Pointer$.base_264| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 |ULTIMATE.start_main_~s~0#1.base|)) |ULTIMATE.start_main_~s~0#1.base|) 4 (select (select |v_#memory_$Pointer$.base_264| |ULTIMATE.start_main_~s~0#1.base|) 4))) |v_#memory_$Pointer$.base_264|) (= |v_#memory_int_249| (store |v_#memory_int_248| (select (select |v_#memory_$Pointer$.base_264| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_int_248| (select (select |v_#memory_$Pointer$.base_264| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 (select (select |v_#memory_int_249| (select (select |v_#memory_$Pointer$.base_264| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0)))) (= (store |v_#memory_$Pointer$.base_264| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_$Pointer$.base_264| |ULTIMATE.start_main_~s~0#1.base|) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 8))) |#memory_$Pointer$.base|) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_264| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (= (store |v_#memory_int_249| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_int_249| |ULTIMATE.start_main_~s~0#1.base|) 4 (select (select |v_#memory_int_250| |ULTIMATE.start_main_~s~0#1.base|) 4))) |v_#memory_int_250|) (<= 4 (select |#length| (select (select |v_#memory_$Pointer$.base_264| |ULTIMATE.start_main_~s~0#1.base|) 4))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_264| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_264| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 0)) |ULTIMATE.start_main_~s~0#1.base| (store (store (select (store |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_264| |ULTIMATE.start_main_~s~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_257| (select (select |v_#memory_$Pointer$.base_264| |ULTIMATE.start_main_~s~0#1.base|) 4)) 0 0)) |ULTIMATE.start_main_~s~0#1.base|) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 8)))))) (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0) |v_ULTIMATE.start_dll_circular_update_at_~head#1.base_56|)) (and (= |ULTIMATE.start_main_~i~0#1| 0) (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.base_56| |ULTIMATE.start_main_~s~0#1.base|))))) (or (and (= 3 |ULTIMATE.start_dll_circular_update_at_~data#1|) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (and (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (= 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~s~0#1.offset| 0))))' at error location [2024-11-09 05:01:47,272 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:01:47,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:01:47,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-11-09 05:01:47,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94797593] [2024-11-09 05:01:47,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:01:47,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:01:47,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:01:47,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:01:47,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2024-11-09 05:01:47,274 INFO L87 Difference]: Start difference. First operand 105 states and 138 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:01:47,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:47,468 INFO L93 Difference]: Finished difference Result 148 states and 197 transitions. [2024-11-09 05:01:47,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:01:47,469 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2024-11-09 05:01:47,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:47,470 INFO L225 Difference]: With dead ends: 148 [2024-11-09 05:01:47,470 INFO L226 Difference]: Without dead ends: 148 [2024-11-09 05:01:47,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2024-11-09 05:01:47,471 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 51 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:47,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 293 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:01:47,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-09 05:01:47,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2024-11-09 05:01:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.5888888888888888) internal successors, (143), 108 states have internal predecessors, (143), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:01:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 147 transitions. [2024-11-09 05:01:47,477 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 147 transitions. Word has length 40 [2024-11-09 05:01:47,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:47,478 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 147 transitions. [2024-11-09 05:01:47,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:01:47,478 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 147 transitions. [2024-11-09 05:01:47,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 05:01:47,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:47,479 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:01:47,504 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 05:01:47,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:01:47,683 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:01:47,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:47,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2112163267, now seen corresponding path program 1 times [2024-11-09 05:01:47,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:01:47,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862993325] [2024-11-09 05:01:47,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:47,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:01:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:48,037 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 05:01:48,038 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:01:48,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862993325] [2024-11-09 05:01:48,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862993325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:01:48,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:01:48,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 05:01:48,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958025820] [2024-11-09 05:01:48,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:01:48,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:01:48,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:01:48,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:01:48,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:01:48,041 INFO L87 Difference]: Start difference. First operand 112 states and 147 transitions. Second operand has 9 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 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 05:01:48,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:48,266 INFO L93 Difference]: Finished difference Result 112 states and 145 transitions. [2024-11-09 05:01:48,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:01:48,267 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 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 43 [2024-11-09 05:01:48,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:48,268 INFO L225 Difference]: With dead ends: 112 [2024-11-09 05:01:48,268 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 05:01:48,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-09 05:01:48,269 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 32 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:48,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 377 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:01:48,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 05:01:48,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-09 05:01:48,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.5666666666666667) internal successors, (141), 108 states have internal predecessors, (141), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:01:48,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 145 transitions. [2024-11-09 05:01:48,273 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 145 transitions. Word has length 43 [2024-11-09 05:01:48,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:48,274 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 145 transitions. [2024-11-09 05:01:48,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 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 05:01:48,274 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 145 transitions. [2024-11-09 05:01:48,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 05:01:48,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:48,275 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:01:48,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 05:01:48,275 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:01:48,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:48,276 INFO L85 PathProgramCache]: Analyzing trace with hash 424980807, now seen corresponding path program 3 times [2024-11-09 05:01:48,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:01:48,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349428148] [2024-11-09 05:01:48,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:48,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:01:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:48,386 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 05:01:48,386 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:01:48,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349428148] [2024-11-09 05:01:48,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349428148] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:01:48,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41091757] [2024-11-09 05:01:48,387 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 05:01:48,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:01:48,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:01:48,389 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:01:48,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 05:01:49,047 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 05:01:49,048 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:01:49,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 05:01:49,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:01:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 05:01:49,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:01:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 05:01:49,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41091757] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:01:49,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1075491393] [2024-11-09 05:01:49,206 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-09 05:01:49,206 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:01:49,207 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:01:49,207 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:01:49,207 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:01:54,208 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 05:01:54,234 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:01:56,745 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6866#(and (or (and (= 3 |ULTIMATE.start_dll_circular_update_at_~data#1|) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (and (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (exists ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.base_68| Int)) (and (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_update_at_~head#1.base_68|) 1)) (or (and (= 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) (= |v_ULTIMATE.start_dll_circular_update_at_~head#1.base_68| |ULTIMATE.start_main_~s~0#1.base|)) (and (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0) |v_ULTIMATE.start_dll_circular_update_at_~head#1.base_68|) (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)))))))' at error location [2024-11-09 05:01:56,746 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:01:56,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:01:56,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 9 [2024-11-09 05:01:56,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285972485] [2024-11-09 05:01:56,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:01:56,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:01:56,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:01:56,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:01:56,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=810, Unknown=1, NotChecked=0, Total=930 [2024-11-09 05:01:56,748 INFO L87 Difference]: Start difference. First operand 112 states and 145 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 05:01:56,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:56,971 INFO L93 Difference]: Finished difference Result 106 states and 126 transitions. [2024-11-09 05:01:56,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:01:56,972 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2024-11-09 05:01:56,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:56,973 INFO L225 Difference]: With dead ends: 106 [2024-11-09 05:01:56,973 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 05:01:56,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=163, Invalid=1168, Unknown=1, NotChecked=0, Total=1332 [2024-11-09 05:01:56,974 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 100 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:56,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 369 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:01:56,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 05:01:56,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 89. [2024-11-09 05:01:56,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 85 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:01:56,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2024-11-09 05:01:56,978 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 44 [2024-11-09 05:01:56,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:56,978 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2024-11-09 05:01:56,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 05:01:56,979 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2024-11-09 05:01:56,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 05:01:56,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:56,979 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:01:57,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 05:01:57,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-09 05:01:57,180 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:01:57,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:57,180 INFO L85 PathProgramCache]: Analyzing trace with hash -872311949, now seen corresponding path program 4 times [2024-11-09 05:01:57,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:01:57,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724136156] [2024-11-09 05:01:57,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:57,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:01:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:57,346 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 05:01:57,346 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:01:57,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724136156] [2024-11-09 05:01:57,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724136156] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:01:57,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096936319] [2024-11-09 05:01:57,347 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 05:01:57,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:01:57,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:01:57,349 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:01:57,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 05:01:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:57,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 05:01:57,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:01:57,718 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 05:01:57,719 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:01:57,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096936319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:01:57,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:01:57,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2024-11-09 05:01:57,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443292638] [2024-11-09 05:01:57,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:01:57,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:01:57,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:01:57,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:01:57,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 05:01:57,721 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:01:57,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:57,795 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2024-11-09 05:01:57,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:01:57,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-11-09 05:01:57,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:57,796 INFO L225 Difference]: With dead ends: 99 [2024-11-09 05:01:57,797 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 05:01:57,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 05:01:57,798 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 31 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:57,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 161 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:01:57,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 05:01:57,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2024-11-09 05:01:57,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 74 states have (on average 1.4864864864864864) internal successors, (110), 88 states have internal predecessors, (110), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:01:57,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 114 transitions. [2024-11-09 05:01:57,803 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 114 transitions. Word has length 44 [2024-11-09 05:01:57,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:57,804 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 114 transitions. [2024-11-09 05:01:57,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:01:57,804 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 114 transitions. [2024-11-09 05:01:57,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 05:01:57,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:57,809 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:01:57,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-09 05:01:58,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 05:01:58,010 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:01:58,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:58,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2113056430, now seen corresponding path program 1 times [2024-11-09 05:01:58,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:01:58,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700103666] [2024-11-09 05:01:58,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:58,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:01:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:59,814 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:59,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:01:59,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700103666] [2024-11-09 05:01:59,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700103666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:01:59,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754318940] [2024-11-09 05:01:59,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:59,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:01:59,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:01:59,817 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:01:59,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 05:02:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:00,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-09 05:02:00,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:02:00,130 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 05:02:00,304 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:02:00,304 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 05:02:00,382 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 11 treesize of output 7 [2024-11-09 05:02:00,440 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 05:02:00,550 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 05:02:00,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-09 05:02:00,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:00,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 43 treesize of output 24 [2024-11-09 05:02:00,757 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 13 treesize of output 9 [2024-11-09 05:02:00,957 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2024-11-09 05:02:01,031 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 05:02:01,281 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:02:01,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:02:01,412 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2458 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2458) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) is different from false [2024-11-09 05:02:01,420 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2458 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_2458) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) is different from false [2024-11-09 05:02:01,432 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2458 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2458) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) is different from false [2024-11-09 05:02:01,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:01,445 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-11-09 05:02:01,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:01,459 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2024-11-09 05:02:01,466 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 18 treesize of output 14 [2024-11-09 05:02:01,809 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2453 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2453) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2024-11-09 05:02:01,815 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2452 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2452) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2453) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2024-11-09 05:02:01,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:01,824 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-09 05:02:01,828 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 65 treesize of output 57 [2024-11-09 05:02:01,837 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 6 treesize of output 4 [2024-11-09 05:02:01,845 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 6 treesize of output 4 [2024-11-09 05:02:01,851 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 6 treesize of output 4 [2024-11-09 05:02:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-09 05:02:02,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754318940] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:02:02,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [770036895] [2024-11-09 05:02:02,333 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2024-11-09 05:02:02,333 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:02:02,334 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:02:02,334 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:02:02,334 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:02:03,232 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 05:02:03,259 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:02:09,542 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7759#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) 2147483647) (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) 2)) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) 2147483648)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2024-11-09 05:02:09,542 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:02:09,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:02:09,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 64 [2024-11-09 05:02:09,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3760160] [2024-11-09 05:02:09,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:02:09,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-09 05:02:09,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:02:09,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-09 05:02:09,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=6951, Unknown=24, NotChecked=860, Total=8190 [2024-11-09 05:02:09,546 INFO L87 Difference]: Start difference. First operand 92 states and 114 transitions. Second operand has 64 states, 59 states have (on average 1.9661016949152543) internal successors, (116), 56 states have internal predecessors, (116), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 05:02:11,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:11,749 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2024-11-09 05:02:11,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 05:02:11,749 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 59 states have (on average 1.9661016949152543) internal successors, (116), 56 states have internal predecessors, (116), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 46 [2024-11-09 05:02:11,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:11,750 INFO L225 Difference]: With dead ends: 100 [2024-11-09 05:02:11,750 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 05:02:11,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2565 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=512, Invalid=9584, Unknown=24, NotChecked=1010, Total=11130 [2024-11-09 05:02:11,752 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 247 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 366 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:11,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1535 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1169 Invalid, 0 Unknown, 366 Unchecked, 1.0s Time] [2024-11-09 05:02:11,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 05:02:11,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2024-11-09 05:02:11,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 75 states have (on average 1.48) internal successors, (111), 89 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:02:11,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2024-11-09 05:02:11,757 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 46 [2024-11-09 05:02:11,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:11,757 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2024-11-09 05:02:11,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 59 states have (on average 1.9661016949152543) internal successors, (116), 56 states have internal predecessors, (116), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 05:02:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2024-11-09 05:02:11,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 05:02:11,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:11,759 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:11,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 05:02:11,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 05:02:11,959 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:02:11,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:11,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2099699431, now seen corresponding path program 1 times [2024-11-09 05:02:11,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:02:11,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125629998] [2024-11-09 05:02:11,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:11,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:02:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:12,065 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 05:02:12,066 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:02:12,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125629998] [2024-11-09 05:02:12,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125629998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:12,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:02:12,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:02:12,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658691301] [2024-11-09 05:02:12,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:12,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:02:12,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:02:12,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:02:12,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:02:12,068 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:02:12,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:12,147 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2024-11-09 05:02:12,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:02:12,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2024-11-09 05:02:12,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:12,148 INFO L225 Difference]: With dead ends: 86 [2024-11-09 05:02:12,149 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 05:02:12,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:02:12,150 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:12,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 168 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:02:12,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 05:02:12,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 05:02:12,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 82 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:02:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2024-11-09 05:02:12,154 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 46 [2024-11-09 05:02:12,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:12,154 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2024-11-09 05:02:12,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:02:12,154 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2024-11-09 05:02:12,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 05:02:12,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:12,155 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:12,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 05:02:12,156 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:02:12,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:12,156 INFO L85 PathProgramCache]: Analyzing trace with hash -959660619, now seen corresponding path program 1 times [2024-11-09 05:02:12,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:02:12,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691721355] [2024-11-09 05:02:12,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:12,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:02:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 05:02:12,322 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:02:12,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691721355] [2024-11-09 05:02:12,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691721355] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:02:12,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107614148] [2024-11-09 05:02:12,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:12,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:02:12,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:02:12,325 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:02:12,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 05:02:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:12,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:02:12,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:02:12,730 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 05:02:12,730 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:02:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 05:02:12,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107614148] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:02:12,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [156828360] [2024-11-09 05:02:12,840 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2024-11-09 05:02:12,840 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:02:12,840 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:02:12,841 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:02:12,841 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:02:13,854 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 05:02:13,888 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:02:17,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [156828360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:02:17,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:02:17,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [6, 5, 5] total 35 [2024-11-09 05:02:17,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193736991] [2024-11-09 05:02:17,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:02:17,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 05:02:17,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:02:17,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 05:02:17,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1006, Unknown=1, NotChecked=0, Total=1190 [2024-11-09 05:02:17,206 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 28 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 24 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:02:21,257 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 05:02:23,424 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 05:02:24,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:24,102 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2024-11-09 05:02:24,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-09 05:02:24,102 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 24 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2024-11-09 05:02:24,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:24,103 INFO L225 Difference]: With dead ends: 88 [2024-11-09 05:02:24,103 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 05:02:24,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=194, Invalid=1065, Unknown=1, NotChecked=0, Total=1260 [2024-11-09 05:02:24,104 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 50 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 6 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:24,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 294 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 851 Invalid, 6 Unknown, 0 Unchecked, 6.8s Time] [2024-11-09 05:02:24,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 05:02:24,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-09 05:02:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 83 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:02:24,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2024-11-09 05:02:24,108 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 48 [2024-11-09 05:02:24,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:24,108 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2024-11-09 05:02:24,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 24 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:02:24,109 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2024-11-09 05:02:24,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 05:02:24,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:24,110 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:24,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-09 05:02:24,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-09 05:02:24,310 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:02:24,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:24,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1334937874, now seen corresponding path program 1 times [2024-11-09 05:02:24,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:02:24,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940537920] [2024-11-09 05:02:24,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:24,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:02:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 05:02:24,421 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:02:24,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940537920] [2024-11-09 05:02:24,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940537920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:02:24,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825602853] [2024-11-09 05:02:24,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:24,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:02:24,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:02:24,423 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:02:24,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-09 05:02:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:24,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 05:02:24,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:02:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 05:02:24,764 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:02:24,811 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 05:02:24,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825602853] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:02:24,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [268334355] [2024-11-09 05:02:24,813 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2024-11-09 05:02:24,813 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:02:24,813 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:02:24,814 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:02:24,814 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:02:25,727 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 05:02:25,755 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:02:29,377 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8988#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) 2147483647) (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) 2)) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) 2147483648)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2024-11-09 05:02:29,377 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:02:29,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:02:29,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-09 05:02:29,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907056860] [2024-11-09 05:02:29,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:02:29,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:02:29,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:02:29,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:02:29,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=920, Unknown=1, NotChecked=0, Total=1056 [2024-11-09 05:02:29,379 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:02:29,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:29,470 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2024-11-09 05:02:29,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:02:29,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2024-11-09 05:02:29,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:29,471 INFO L225 Difference]: With dead ends: 85 [2024-11-09 05:02:29,471 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 05:02:29,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 120 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=140, Invalid=981, Unknown=1, NotChecked=0, Total=1122 [2024-11-09 05:02:29,472 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 47 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:29,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 160 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:02:29,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 05:02:29,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-09 05:02:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 67 states have (on average 1.328358208955224) internal successors, (89), 81 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:02:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2024-11-09 05:02:29,476 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 51 [2024-11-09 05:02:29,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:29,476 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2024-11-09 05:02:29,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:02:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2024-11-09 05:02:29,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 05:02:29,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:29,478 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:29,497 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-09 05:02:29,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:02:29,678 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:02:29,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:29,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1321580875, now seen corresponding path program 1 times [2024-11-09 05:02:29,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:02:29,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098085436] [2024-11-09 05:02:29,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:29,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:02:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 05:02:31,035 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:02:31,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098085436] [2024-11-09 05:02:31,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098085436] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:02:31,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379491414] [2024-11-09 05:02:31,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:31,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:02:31,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:02:31,038 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:02:31,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-09 05:02:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:31,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-09 05:02:31,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:02:31,378 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 05:02:31,484 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:02:31,485 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 05:02:31,561 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 11 treesize of output 7 [2024-11-09 05:02:31,621 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 05:02:31,719 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 05:02:31,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-09 05:02:31,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:02:31,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:02:31,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:31,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 29 [2024-11-09 05:02:32,156 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:02:32,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 46 [2024-11-09 05:02:32,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:32,287 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 16 [2024-11-09 05:02:32,291 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 05:02:32,291 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:02:32,463 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2998 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2998) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2024-11-09 05:02:32,479 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2998 (Array Int Int)) (v_ArrVal_2997 (Array Int Int))) (or (not (= v_ArrVal_2997 (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_2997 .cse0))))) (= (select |c_#valid| (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2997))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2998)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1))) is different from false [2024-11-09 05:02:32,500 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2998 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_91| Int)) (or (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2997) (select v_ArrVal_2997 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2998) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_91| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (= v_ArrVal_2997 (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_91| 8))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 (select v_ArrVal_2997 .cse0))))))) is different from false [2024-11-09 05:02:32,532 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2998 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_91| Int)) (or (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_91| 8))) (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 (select v_ArrVal_2997 .cse0))) v_ArrVal_2997)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_91| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2997) (select v_ArrVal_2997 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2998) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1))) is different from false [2024-11-09 05:02:32,552 INFO L349 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2024-11-09 05:02:32,553 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 27 treesize of output 26 [2024-11-09 05:02:32,570 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2998 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2995 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_91| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2995))) (or (not (= v_ArrVal_2997 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_91| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_2997 .cse1))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_91| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2997) (select v_ArrVal_2997 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2998) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) is different from false [2024-11-09 05:02:32,611 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2998 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2995 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_91| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2995))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_91| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2997) (select v_ArrVal_2997 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_2998) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= v_ArrVal_2997 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_91| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_2997 .cse1)))))))) is different from false [2024-11-09 05:02:32,633 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2998 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_2995 (Array Int Int)) (v_ArrVal_2994 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_91| Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2994) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2995))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_91| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_ArrVal_2997 (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_91| 8))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_2997 .cse1))))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2997) (select v_ArrVal_2997 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_2998) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) is different from false [2024-11-09 05:02:32,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:32,665 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 58 [2024-11-09 05:02:32,673 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 113 treesize of output 109 [2024-11-09 05:02:32,681 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:32,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:32,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 109 [2024-11-09 05:02:32,704 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:32,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:32,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 81 [2024-11-09 05:02:32,728 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:32,729 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:32,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:32,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 77 [2024-11-09 05:02:32,772 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 11 treesize of output 9 [2024-11-09 05:02:32,905 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:32,906 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:32,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 123 [2024-11-09 05:02:32,958 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:32,959 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:32,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 70 [2024-11-09 05:02:32,986 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 8 treesize of output 4 [2024-11-09 05:02:33,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379491414] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:02:33,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [909653210] [2024-11-09 05:02:33,072 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2024-11-09 05:02:33,073 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:02:33,073 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:02:33,073 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:02:33,074 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:02:37,028 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 05:02:37,059 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:02:43,043 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9485#(and (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~expected~0#1|) (exists ((|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_50| Int)) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_50|) 1))) (<= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2024-11-09 05:02:43,043 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:02:43,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:02:43,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 35 [2024-11-09 05:02:43,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576480858] [2024-11-09 05:02:43,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:02:43,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 05:02:43,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:02:43,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 05:02:43,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=4163, Unknown=29, NotChecked=952, Total=5402 [2024-11-09 05:02:43,047 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 36 states, 32 states have (on average 2.59375) internal successors, (83), 32 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 05:02:44,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:02:44,009 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2024-11-09 05:02:44,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 05:02:44,009 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 2.59375) internal successors, (83), 32 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-09 05:02:44,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:02:44,010 INFO L225 Difference]: With dead ends: 89 [2024-11-09 05:02:44,010 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 05:02:44,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1516 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=313, Invalid=5087, Unknown=30, NotChecked=1050, Total=6480 [2024-11-09 05:02:44,012 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 79 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:02:44,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 855 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 05:02:44,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 05:02:44,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 05:02:44,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 71 states have (on average 1.352112676056338) internal successors, (96), 85 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:02:44,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2024-11-09 05:02:44,016 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 51 [2024-11-09 05:02:44,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:02:44,017 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2024-11-09 05:02:44,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 2.59375) internal successors, (83), 32 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 05:02:44,017 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2024-11-09 05:02:44,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 05:02:44,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:02:44,018 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:02:44,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-09 05:02:44,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:02:44,218 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:02:44,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:02:44,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1321580876, now seen corresponding path program 1 times [2024-11-09 05:02:44,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:02:44,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15331459] [2024-11-09 05:02:44,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:44,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:02:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:46,299 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 05:02:46,299 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:02:46,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15331459] [2024-11-09 05:02:46,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15331459] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:02:46,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481519401] [2024-11-09 05:02:46,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:02:46,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:02:46,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:02:46,302 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:02:46,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-09 05:02:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:02:46,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-09 05:02:46,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:02:46,678 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 05:02:46,685 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 05:02:47,076 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:02:47,076 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 05:02:47,085 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 05:02:47,223 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 15 treesize of output 1 [2024-11-09 05:02:47,242 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 11 treesize of output 7 [2024-11-09 05:02:47,353 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:02:47,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-09 05:02:47,360 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 31 treesize of output 16 [2024-11-09 05:02:47,560 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 05:02:47,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 05:02:47,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:02:47,576 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 23 treesize of output 16 [2024-11-09 05:02:47,674 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 40 treesize of output 20 [2024-11-09 05:02:47,685 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 35 treesize of output 26 [2024-11-09 05:02:47,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:02:47,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:02:47,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 26 [2024-11-09 05:02:47,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:02:47,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:02:47,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:47,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 29 [2024-11-09 05:02:48,365 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:02:48,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 54 [2024-11-09 05:02:48,376 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 46 treesize of output 27 [2024-11-09 05:02:48,695 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-09 05:02:48,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:48,702 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2024-11-09 05:02:48,776 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 05:02:48,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:02:49,082 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3164 (Array Int Int)) (v_ArrVal_3165 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3164) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3165) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_3164 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3164) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))) is different from false [2024-11-09 05:02:49,106 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_3164 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3164) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) (forall ((v_ArrVal_3164 (Array Int Int)) (v_ArrVal_3165 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3164) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3165) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2024-11-09 05:02:49,149 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((v_ArrVal_3164 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3164) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_3164 (Array Int Int)) (v_ArrVal_3165 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3164) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3165) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2024-11-09 05:02:49,240 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_3163 (Array Int Int))) (or (not (= v_ArrVal_3163 (store .cse0 .cse1 (select v_ArrVal_3163 .cse1)))) (forall ((v_ArrVal_3162 (Array Int Int))) (or (not (= (store .cse2 .cse1 (select v_ArrVal_3162 .cse1)) v_ArrVal_3162)) (forall ((v_ArrVal_3164 (Array Int Int)) (v_ArrVal_3165 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3162))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3163) .cse3 v_ArrVal_3164) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_3165) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))))) (forall ((v_ArrVal_3163 (Array Int Int))) (or (not (= v_ArrVal_3163 (store .cse0 .cse1 (select v_ArrVal_3163 .cse1)))) (forall ((v_ArrVal_3162 (Array Int Int))) (or (not (= (store .cse2 .cse1 (select v_ArrVal_3162 .cse1)) v_ArrVal_3162)) (forall ((v_ArrVal_3164 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3163) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3162) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3164) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))))))))) is different from false [2024-11-09 05:02:49,329 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((v_ArrVal_3163 (Array Int Int)) (v_ArrVal_3164 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (= (let ((.cse1 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse0 .cse1 (select v_ArrVal_3163 .cse1))) v_ArrVal_3163)) (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3163) (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3164) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3163 (Array Int Int))) (let ((.cse3 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (or (not (= (store .cse0 .cse3 (select v_ArrVal_3163 .cse3)) v_ArrVal_3163)) (forall ((v_ArrVal_3162 (Array Int Int))) (or (forall ((v_ArrVal_3164 (Array Int Int)) (v_ArrVal_3165 (Array Int Int))) (let ((.cse4 (select v_ArrVal_3162 |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3163) .cse4 v_ArrVal_3164) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3162) .cse4 v_ArrVal_3165) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (not (= v_ArrVal_3162 (store .cse2 .cse3 (select v_ArrVal_3162 .cse3))))))))))))) is different from false [2024-11-09 05:02:49,421 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse0 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3163 (Array Int Int))) (let ((.cse1 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_3163 .cse1)) v_ArrVal_3163)) (forall ((v_ArrVal_3162 (Array Int Int))) (or (not (= v_ArrVal_3162 (store (store .cse2 .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_3162 .cse1)))) (forall ((v_ArrVal_3164 (Array Int Int)) (v_ArrVal_3165 (Array Int Int))) (let ((.cse4 (select v_ArrVal_3162 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3163) .cse4 v_ArrVal_3164) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3162) .cse4 v_ArrVal_3165) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))))))))) (forall ((v_ArrVal_3163 (Array Int Int)) (v_ArrVal_3164 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| Int)) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3163) (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3164) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 9)) (not (= (let ((.cse5 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101|))) (store .cse0 .cse5 (select v_ArrVal_3163 .cse5))) v_ArrVal_3163)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_101| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) is different from false [2024-11-09 05:02:50,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:50,701 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 102 [2024-11-09 05:02:50,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:50,720 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 120 [2024-11-09 05:02:50,735 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 113 treesize of output 109 [2024-11-09 05:02:50,747 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:50,748 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:50,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:50,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 119 [2024-11-09 05:02:50,785 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:50,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:50,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 81 [2024-11-09 05:02:50,814 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:50,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:50,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 67 [2024-11-09 05:02:50,846 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 227 treesize of output 221 [2024-11-09 05:02:50,870 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:50,872 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:50,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:50,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 119 [2024-11-09 05:02:50,920 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:50,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:50,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 95 [2024-11-09 05:02:50,955 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:50,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:50,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 67 [2024-11-09 05:02:50,998 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 17 treesize of output 15 [2024-11-09 05:02:51,026 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 15 treesize of output 13 [2024-11-09 05:02:51,519 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:51,520 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:51,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 298 treesize of output 270 [2024-11-09 05:02:51,636 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:51,637 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:51,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 164 [2024-11-09 05:02:51,715 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:51,716 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:51,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 126 [2024-11-09 05:02:51,767 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 87 treesize of output 81 [2024-11-09 05:02:51,804 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:51,804 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 69 treesize of output 53 [2024-11-09 05:02:51,820 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 8 treesize of output 4 [2024-11-09 05:02:51,834 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:51,834 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:51,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:51,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 94 [2024-11-09 05:02:51,852 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:51,853 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:51,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 29 treesize of output 25 [2024-11-09 05:02:51,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:51,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 52 [2024-11-09 05:02:51,875 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:51,875 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:51,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 40 treesize of output 28 [2024-11-09 05:02:51,885 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:51,886 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:51,888 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:02:51,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:51,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 19 [2024-11-09 05:02:51,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:02:51,911 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 22 treesize of output 14 [2024-11-09 05:02:52,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481519401] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:02:52,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [737411657] [2024-11-09 05:02:52,295 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2024-11-09 05:02:52,295 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:02:52,296 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:02:52,296 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:02:52,296 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:02:53,670 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 05:02:53,692 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:03:01,049 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10015#(and (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2024-11-09 05:03:01,049 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:03:01,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:03:01,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 41 [2024-11-09 05:03:01,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59475379] [2024-11-09 05:03:01,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:03:01,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-09 05:03:01,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:01,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-09 05:03:01,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=5733, Unknown=9, NotChecked=942, Total=6972 [2024-11-09 05:03:01,052 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand has 42 states, 37 states have (on average 2.4324324324324325) internal successors, (90), 37 states have internal predecessors, (90), 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 05:03:03,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:03,358 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2024-11-09 05:03:03,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 05:03:03,359 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 37 states have (on average 2.4324324324324325) internal successors, (90), 37 states have internal predecessors, (90), 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 51 [2024-11-09 05:03:03,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:03,360 INFO L225 Difference]: With dead ends: 89 [2024-11-09 05:03:03,360 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 05:03:03,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=400, Invalid=7987, Unknown=9, NotChecked=1110, Total=9506 [2024-11-09 05:03:03,362 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 96 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:03,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1348 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 05:03:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 05:03:03,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 05:03:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 71 states have (on average 1.323943661971831) internal successors, (94), 85 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:03:03,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2024-11-09 05:03:03,367 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 51 [2024-11-09 05:03:03,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:03,367 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2024-11-09 05:03:03,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 37 states have (on average 2.4324324324324325) internal successors, (90), 37 states have internal predecessors, (90), 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 05:03:03,368 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2024-11-09 05:03:03,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 05:03:03,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:03,369 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:03:03,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-09 05:03:03,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-09 05:03:03,570 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:03:03,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:03,570 INFO L85 PathProgramCache]: Analyzing trace with hash -746235585, now seen corresponding path program 1 times [2024-11-09 05:03:03,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:03,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396487599] [2024-11-09 05:03:03,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:03,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:06,329 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:06,329 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:06,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396487599] [2024-11-09 05:03:06,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396487599] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:03:06,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404747940] [2024-11-09 05:03:06,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:06,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:03:06,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:03:06,331 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:03:06,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-09 05:03:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:06,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-11-09 05:03:06,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:03:06,760 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 05:03:07,019 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:03:07,019 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 05:03:07,116 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 11 treesize of output 7 [2024-11-09 05:03:07,200 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:03:07,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2024-11-09 05:03:07,340 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 05:03:07,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-09 05:03:07,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-09 05:03:07,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:03:07,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:03:07,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:03:07,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 24 [2024-11-09 05:03:07,913 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:03:07,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 68 [2024-11-09 05:03:07,921 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 25 treesize of output 17 [2024-11-09 05:03:07,925 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 34 treesize of output 21 [2024-11-09 05:03:08,403 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 24 [2024-11-09 05:03:08,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 13 [2024-11-09 05:03:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:08,527 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:03:08,868 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 76 treesize of output 56 [2024-11-09 05:03:08,885 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3328 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3328) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_3329 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3329) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2024-11-09 05:03:08,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:03:08,910 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2024-11-09 05:03:08,915 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 13 treesize of output 11 [2024-11-09 05:03:09,168 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3326 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3326) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= v_ArrVal_3326 (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_3326 .cse0))))))) (= |c_ULTIMATE.start_main_~i~0#1| 0)) is different from false [2024-11-09 05:03:09,655 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3323 (Array Int Int)) (v_ArrVal_3324 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3323) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3324) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2024-11-09 05:03:09,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:03:09,666 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-09 05:03:09,672 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 65 treesize of output 57 [2024-11-09 05:03:09,680 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 6 treesize of output 4 [2024-11-09 05:03:09,686 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 6 treesize of output 4 [2024-11-09 05:03:09,689 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 6 treesize of output 4 [2024-11-09 05:03:10,317 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 05:03:10,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404747940] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:03:10,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [143159247] [2024-11-09 05:03:10,319 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2024-11-09 05:03:10,319 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:03:10,320 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:03:10,320 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:03:10,320 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:03:11,360 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 05:03:11,387 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:03:19,144 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10640#(and (<= 1 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (exists ((|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_80| Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_76| Int) (|v_ULTIMATE.start_main_~expected~0#1_48| Int)) (and (<= 2 |v_ULTIMATE.start_main_~expected~0#1_48|) (not (= |v_ULTIMATE.start_main_~expected~0#1_48| (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_80|) (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_76| 8)))) (<= |v_ULTIMATE.start_main_~expected~0#1_48| 3) (<= (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_80|) (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_76| 8)) 2147483647) (<= 0 (+ (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_80|) (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_76| 8)) 2147483648)) (<= 0 (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_76| 8)) (<= (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_76| 12) (select |#length| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_80|)) (= (select |#valid| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_80|) 1))) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2024-11-09 05:03:19,144 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:03:19,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:03:19,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26, 27] total 74 [2024-11-09 05:03:19,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168846709] [2024-11-09 05:03:19,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:03:19,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-11-09 05:03:19,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:19,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-11-09 05:03:19,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=9265, Unknown=30, NotChecked=588, Total=10302 [2024-11-09 05:03:19,147 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 74 states, 67 states have (on average 2.1044776119402986) internal successors, (141), 66 states have internal predecessors, (141), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 05:03:21,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:21,942 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2024-11-09 05:03:21,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 05:03:21,943 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 67 states have (on average 2.1044776119402986) internal successors, (141), 66 states have internal predecessors, (141), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2024-11-09 05:03:21,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:21,943 INFO L225 Difference]: With dead ends: 90 [2024-11-09 05:03:21,943 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 05:03:21,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 119 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 4364 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=632, Invalid=13156, Unknown=30, NotChecked=702, Total=14520 [2024-11-09 05:03:21,945 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 208 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:21,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1638 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1549 Invalid, 0 Unknown, 186 Unchecked, 1.2s Time] [2024-11-09 05:03:21,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 05:03:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-09 05:03:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 86 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:03:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2024-11-09 05:03:21,948 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 54 [2024-11-09 05:03:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:21,949 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2024-11-09 05:03:21,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 67 states have (on average 2.1044776119402986) internal successors, (141), 66 states have internal predecessors, (141), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 05:03:21,949 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2024-11-09 05:03:21,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 05:03:21,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:21,950 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:03:21,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-09 05:03:22,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-09 05:03:22,151 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:03:22,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:22,151 INFO L85 PathProgramCache]: Analyzing trace with hash -759592584, now seen corresponding path program 2 times [2024-11-09 05:03:22,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:22,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773021418] [2024-11-09 05:03:22,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:22,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 05:03:22,287 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:22,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773021418] [2024-11-09 05:03:22,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773021418] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:03:22,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966656682] [2024-11-09 05:03:22,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 05:03:22,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:03:22,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:03:22,290 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:03:22,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-09 05:03:22,933 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 05:03:22,933 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:03:22,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 05:03:22,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:03:22,961 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 05:03:22,962 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:03:23,011 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 05:03:23,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966656682] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:03:23,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1966109548] [2024-11-09 05:03:23,016 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2024-11-09 05:03:23,016 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:03:23,016 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:03:23,016 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:03:23,016 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:03:27,952 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 05:03:27,973 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:03:30,775 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '11211#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_95| Int)) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_95|) 1))) (<= |ULTIMATE.start_main_~expected~0#1| 3) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2024-11-09 05:03:30,775 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:03:30,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:03:30,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-11-09 05:03:30,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489067559] [2024-11-09 05:03:30,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:03:30,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:03:30,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:30,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:03:30,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1050, Unknown=1, NotChecked=0, Total=1190 [2024-11-09 05:03:30,777 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:03:30,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:30,880 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2024-11-09 05:03:30,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:03:30,881 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2024-11-09 05:03:30,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:30,881 INFO L225 Difference]: With dead ends: 76 [2024-11-09 05:03:30,881 INFO L226 Difference]: Without dead ends: 76 [2024-11-09 05:03:30,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 128 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=160, Invalid=1245, Unknown=1, NotChecked=0, Total=1406 [2024-11-09 05:03:30,883 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 15 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:30,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 228 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:03:30,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-09 05:03:30,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-09 05:03:30,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 63 states have (on average 1.253968253968254) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:03:30,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2024-11-09 05:03:30,885 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 54 [2024-11-09 05:03:30,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:30,886 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2024-11-09 05:03:30,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:03:30,887 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2024-11-09 05:03:30,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 05:03:30,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:30,888 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:03:30,912 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-09 05:03:31,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-09 05:03:31,089 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:03:31,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:31,090 INFO L85 PathProgramCache]: Analyzing trace with hash 39782406, now seen corresponding path program 1 times [2024-11-09 05:03:31,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:31,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892799658] [2024-11-09 05:03:31,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:31,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 05:03:31,464 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:31,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892799658] [2024-11-09 05:03:31,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892799658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:31,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:03:31,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 05:03:31,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859865115] [2024-11-09 05:03:31,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:31,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:03:31,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:31,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:03:31,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:03:31,466 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 9 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 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 05:03:31,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:31,646 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2024-11-09 05:03:31,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:03:31,647 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 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 56 [2024-11-09 05:03:31,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:31,647 INFO L225 Difference]: With dead ends: 74 [2024-11-09 05:03:31,647 INFO L226 Difference]: Without dead ends: 74 [2024-11-09 05:03:31,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:03:31,648 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:31,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 233 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:03:31,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-09 05:03:31,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-09 05:03:31,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:03:31,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2024-11-09 05:03:31,652 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 56 [2024-11-09 05:03:31,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:31,652 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2024-11-09 05:03:31,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 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 05:03:31,652 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2024-11-09 05:03:31,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 05:03:31,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:31,653 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:03:31,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-09 05:03:31,654 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:03:31,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:31,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1233288449, now seen corresponding path program 1 times [2024-11-09 05:03:31,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:31,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203452466] [2024-11-09 05:03:31,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:31,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:31,836 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 05:03:31,837 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:31,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203452466] [2024-11-09 05:03:31,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203452466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:31,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:03:31,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 05:03:31,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584190445] [2024-11-09 05:03:31,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:31,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:03:31,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:31,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:03:31,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:03:31,839 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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 05:03:32,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:32,008 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2024-11-09 05:03:32,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:03:32,009 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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 57 [2024-11-09 05:03:32,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:32,010 INFO L225 Difference]: With dead ends: 74 [2024-11-09 05:03:32,010 INFO L226 Difference]: Without dead ends: 74 [2024-11-09 05:03:32,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:03:32,010 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:32,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 236 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:03:32,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-09 05:03:32,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-09 05:03:32,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 70 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:03:32,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2024-11-09 05:03:32,014 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 57 [2024-11-09 05:03:32,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:32,014 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2024-11-09 05:03:32,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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 05:03:32,014 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2024-11-09 05:03:32,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 05:03:32,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:32,015 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:03:32,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-09 05:03:32,015 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:03:32,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:32,016 INFO L85 PathProgramCache]: Analyzing trace with hash -250749401, now seen corresponding path program 1 times [2024-11-09 05:03:32,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:32,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517257129] [2024-11-09 05:03:32,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:32,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:32,239 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 05:03:32,239 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:32,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517257129] [2024-11-09 05:03:32,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517257129] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:03:32,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249498538] [2024-11-09 05:03:32,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:32,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:03:32,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:03:32,241 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:03:32,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-09 05:03:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:32,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-09 05:03:32,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:03:32,630 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 05:03:32,788 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:03:32,788 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 05:03:32,847 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 11 treesize of output 7 [2024-11-09 05:03:32,905 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:03:32,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2024-11-09 05:03:32,983 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 05:03:32,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-09 05:03:33,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-09 05:03:33,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:03:33,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:03:33,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:03:33,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 29 [2024-11-09 05:03:33,305 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:03:33,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 46 [2024-11-09 05:03:33,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:03:33,470 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 16 [2024-11-09 05:03:33,475 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 05:03:33,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:03:33,576 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3795 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3795) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2024-11-09 05:03:33,586 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3795 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3795) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2024-11-09 05:03:33,599 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3794 (Array Int Int)) (v_ArrVal_3795 (Array Int Int))) (or (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3794))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3795)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_3794 .cse1))) v_ArrVal_3794)))) is different from false [2024-11-09 05:03:33,619 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_129| Int) (v_ArrVal_3794 (Array Int Int)) (v_ArrVal_3795 (Array Int Int))) (or (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3794) (select v_ArrVal_3794 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3795) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= (let ((.cse0 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_129|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 (select v_ArrVal_3794 .cse0))) v_ArrVal_3794)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_129| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-11-09 05:03:33,643 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_129| Int) (v_ArrVal_3794 (Array Int Int)) (v_ArrVal_3795 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_129| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= (let ((.cse0 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_129|))) (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 (select v_ArrVal_3794 .cse0))) v_ArrVal_3794)) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3794) (select v_ArrVal_3794 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3795) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1))) is different from false [2024-11-09 05:03:33,660 INFO L349 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2024-11-09 05:03:33,660 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 27 treesize of output 26 [2024-11-09 05:03:33,673 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3791 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_129| Int) (v_ArrVal_3794 (Array Int Int)) (v_ArrVal_3795 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3791))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_129| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3794) (select v_ArrVal_3794 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3795) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= v_ArrVal_3794 (let ((.cse1 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_129|))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_3794 .cse1)))))))) is different from false [2024-11-09 05:03:33,701 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3791 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_129| Int) (v_ArrVal_3794 (Array Int Int)) (v_ArrVal_3795 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3791))) (or (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3794) (select v_ArrVal_3794 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3795) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_129| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= (let ((.cse1 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_129|))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_3794 .cse1))) v_ArrVal_3794))))) is different from false [2024-11-09 05:03:33,717 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3790 (Array Int Int)) (v_ArrVal_3791 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_129| Int) (v_ArrVal_3794 (Array Int Int)) (v_ArrVal_3795 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3790) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3791))) (or (not (= (let ((.cse1 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_129|))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_3794 .cse1))) v_ArrVal_3794)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_129| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3794) (select v_ArrVal_3794 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3795) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) is different from false [2024-11-09 05:03:33,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:03:33,739 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 58 [2024-11-09 05:03:33,744 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 113 treesize of output 109 [2024-11-09 05:03:33,750 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:03:33,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:03:33,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 95 [2024-11-09 05:03:33,769 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:03:33,769 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:03:33,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:03:33,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 91 [2024-11-09 05:03:33,790 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:03:33,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:03:33,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 67 [2024-11-09 05:03:33,808 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 11 treesize of output 9 [2024-11-09 05:03:33,902 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:03:33,903 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:03:33,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 123 [2024-11-09 05:03:33,943 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:03:33,944 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 92 treesize of output 72 [2024-11-09 05:03:33,970 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 37 treesize of output 31 [2024-11-09 05:03:34,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249498538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:03:34,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1355801721] [2024-11-09 05:03:34,049 INFO L159 IcfgInterpreter]: Started Sifa with 40 locations of interest [2024-11-09 05:03:34,049 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:03:34,050 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:03:34,050 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:03:34,050 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:03:35,213 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 05:03:35,231 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:03:41,495 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12046#(and (not (= |ULTIMATE.start_dll_circular_destroy_~head#1.base| 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_destroy_~head#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)) 1)) (= 1 (select |#valid| |ULTIMATE.start_dll_circular_destroy_~head#1.base|)) (<= (+ |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_destroy_~head#1.base|)) (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_destroy_~head#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)) (exists ((|v_ULTIMATE.start_main_~i~0#1_172| Int) (|v_ULTIMATE.start_main_~len~0#1_18| Int)) (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_108| Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_103| Int)) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_108|) (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_103| 8)) 3) (<= 0 (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_103| 8)) (<= 2 (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_108|) (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_103| 8))) (<= (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_103| 12) (select |#length| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_108|)) (= (select |#valid| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_108|) 1))) (= 2 |v_ULTIMATE.start_main_~i~0#1_172|) (= |v_ULTIMATE.start_main_~len~0#1_18| 2))))' at error location [2024-11-09 05:03:41,495 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:03:41,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:03:41,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 20] total 24 [2024-11-09 05:03:41,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22833108] [2024-11-09 05:03:41,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:03:41,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 05:03:41,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:41,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 05:03:41,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3335, Unknown=18, NotChecked=984, Total=4556 [2024-11-09 05:03:41,497 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 25 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 05:03:42,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:42,139 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2024-11-09 05:03:42,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 05:03:42,140 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 59 [2024-11-09 05:03:42,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:42,141 INFO L225 Difference]: With dead ends: 80 [2024-11-09 05:03:42,141 INFO L226 Difference]: Without dead ends: 80 [2024-11-09 05:03:42,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=242, Invalid=3932, Unknown=18, NotChecked=1064, Total=5256 [2024-11-09 05:03:42,142 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 31 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:42,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 508 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 05:03:42,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-09 05:03:42,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2024-11-09 05:03:42,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.1875) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:03:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2024-11-09 05:03:42,147 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 59 [2024-11-09 05:03:42,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:42,148 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2024-11-09 05:03:42,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 05:03:42,148 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2024-11-09 05:03:42,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 05:03:42,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:42,148 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:03:42,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-09 05:03:42,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-09 05:03:42,349 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:03:42,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:42,350 INFO L85 PathProgramCache]: Analyzing trace with hash -250749400, now seen corresponding path program 1 times [2024-11-09 05:03:42,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:42,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566207] [2024-11-09 05:03:42,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:42,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:44,019 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 05:03:44,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:44,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566207] [2024-11-09 05:03:44,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566207] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:03:44,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113958344] [2024-11-09 05:03:44,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:44,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:03:44,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:03:44,020 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:03:44,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-09 05:03:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:44,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-11-09 05:03:44,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:03:44,386 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 05:03:44,498 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:03:44,498 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 05:03:44,602 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 11 treesize of output 7 [2024-11-09 05:03:44,608 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 11 treesize of output 7 [2024-11-09 05:03:44,697 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:03:44,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-09 05:03:44,705 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 24 treesize of output 11 [2024-11-09 05:03:44,854 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 05:03:44,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 05:03:44,872 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 05:03:44,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 05:03:44,940 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 19 treesize of output 18 [2024-11-09 05:03:44,947 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 33 treesize of output 24 [2024-11-09 05:03:45,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:03:45,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:03:45,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2024-11-09 05:03:45,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:03:45,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:03:45,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 27 [2024-11-09 05:03:45,464 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:03:45,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 52 [2024-11-09 05:03:45,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:03:45,476 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 31 treesize of output 16 [2024-11-09 05:03:45,791 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2024-11-09 05:03:45,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 05:03:45,842 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 05:03:45,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:03:50,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:03:50,489 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 169 treesize of output 173 [2024-11-09 05:03:51,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:03:51,145 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 58 [2024-11-09 05:03:51,155 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 113 treesize of output 109 [2024-11-09 05:03:51,163 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:03:51,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:03:51,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 95 [2024-11-09 05:03:51,184 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:03:51,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:03:51,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 81 [2024-11-09 05:03:51,205 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:03:51,206 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:03:51,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:03:51,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 77 [2024-11-09 05:03:51,230 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 11 treesize of output 9 [2024-11-09 05:03:51,321 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:03:51,322 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 107 treesize of output 87 [2024-11-09 05:03:51,355 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:03:51,356 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:03:51,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 53 [2024-11-09 05:03:51,372 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 15 treesize of output 9 [2024-11-09 05:03:51,375 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:03:51,376 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:03:51,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:03:51,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 94 [2024-11-09 05:03:51,386 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:03:51,387 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:03:51,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 29 treesize of output 25 [2024-11-09 05:03:51,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:03:51,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 48 [2024-11-09 05:03:51,404 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:03:51,405 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:03:51,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 36 treesize of output 24 [2024-11-09 05:03:51,414 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:03:51,414 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:03:51,417 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:03:51,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:03:51,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 19 [2024-11-09 05:03:51,432 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 22 treesize of output 14 [2024-11-09 05:03:51,446 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 05:03:51,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 1 [2024-11-09 05:03:51,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113958344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:03:51,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1924669559] [2024-11-09 05:03:51,773 INFO L159 IcfgInterpreter]: Started Sifa with 40 locations of interest [2024-11-09 05:03:51,774 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:03:51,774 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:03:51,774 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:03:51,774 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:03:55,725 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 05:03:55,746 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:04:05,551 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12600#(<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)' at error location [2024-11-09 05:04:05,551 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:04:05,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:04:05,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20] total 39 [2024-11-09 05:04:05,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006593700] [2024-11-09 05:04:05,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:04:05,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-09 05:04:05,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:04:05,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-09 05:04:05,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=7294, Unknown=22, NotChecked=0, Total=7656 [2024-11-09 05:04:05,553 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 40 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 36 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:04:06,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:04:06,564 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2024-11-09 05:04:06,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 05:04:06,565 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 36 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2024-11-09 05:04:06,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:04:06,566 INFO L225 Difference]: With dead ends: 75 [2024-11-09 05:04:06,566 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 05:04:06,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 96 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2664 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=380, Invalid=8154, Unknown=22, NotChecked=0, Total=8556 [2024-11-09 05:04:06,567 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 43 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:04:06,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 601 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 05:04:06,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 05:04:06,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-09 05:04:06,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 71 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:04:06,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2024-11-09 05:04:06,570 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 59 [2024-11-09 05:04:06,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:04:06,571 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2024-11-09 05:04:06,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 36 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:04:06,571 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2024-11-09 05:04:06,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 05:04:06,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:04:06,572 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:04:06,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-11-09 05:04:06,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-09 05:04:06,773 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:04:06,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:04:06,773 INFO L85 PathProgramCache]: Analyzing trace with hash -250732585, now seen corresponding path program 1 times [2024-11-09 05:04:06,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:04:06,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604696467] [2024-11-09 05:04:06,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:04:06,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:04:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:04:07,012 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 05:04:07,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:04:07,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604696467] [2024-11-09 05:04:07,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604696467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:04:07,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:04:07,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 05:04:07,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314166565] [2024-11-09 05:04:07,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:04:07,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:04:07,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:04:07,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:04:07,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:04:07,015 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 9 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 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 05:04:07,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:04:07,263 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2024-11-09 05:04:07,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:04:07,264 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 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 59 [2024-11-09 05:04:07,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:04:07,264 INFO L225 Difference]: With dead ends: 74 [2024-11-09 05:04:07,265 INFO L226 Difference]: Without dead ends: 74 [2024-11-09 05:04:07,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:04:07,266 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:04:07,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 196 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:04:07,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-09 05:04:07,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-09 05:04:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:04:07,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2024-11-09 05:04:07,269 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 59 [2024-11-09 05:04:07,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:04:07,269 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2024-11-09 05:04:07,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 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 05:04:07,270 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2024-11-09 05:04:07,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 05:04:07,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:04:07,271 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:04:07,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-09 05:04:07,271 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:04:07,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:04:07,271 INFO L85 PathProgramCache]: Analyzing trace with hash -451942811, now seen corresponding path program 1 times [2024-11-09 05:04:07,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:04:07,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791759238] [2024-11-09 05:04:07,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:04:07,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:04:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:04:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 05:04:08,551 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:04:08,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791759238] [2024-11-09 05:04:08,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791759238] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:04:08,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708362468] [2024-11-09 05:04:08,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:04:08,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:04:08,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:04:08,553 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:04:08,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-09 05:04:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:04:08,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-09 05:04:08,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:04:08,952 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 05:04:09,037 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 05:04:09,139 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:04:09,139 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 05:04:09,254 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 11 treesize of output 7 [2024-11-09 05:04:09,333 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 05:04:09,457 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 05:04:09,471 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 35 treesize of output 26 [2024-11-09 05:04:09,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:04:09,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:04:09,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:04:09,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 29 [2024-11-09 05:04:09,897 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:04:09,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 46 [2024-11-09 05:04:10,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:04:10,151 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2024-11-09 05:04:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 05:04:10,209 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:04:11,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:04:11,664 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 58 [2024-11-09 05:04:11,669 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 113 treesize of output 109 [2024-11-09 05:04:11,675 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:04:11,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:04:11,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 95 [2024-11-09 05:04:11,690 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:04:11,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:04:11,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 81 [2024-11-09 05:04:11,711 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:04:11,712 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:04:11,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:04:11,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 77 [2024-11-09 05:04:11,734 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 13 treesize of output 11 [2024-11-09 05:04:11,837 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:04:11,838 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:04:11,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 160 [2024-11-09 05:04:11,915 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:04:11,916 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:04:11,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 108 [2024-11-09 05:04:11,956 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 63 treesize of output 51 [2024-11-09 05:04:12,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708362468] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:04:12,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1206860821] [2024-11-09 05:04:12,268 INFO L159 IcfgInterpreter]: Started Sifa with 42 locations of interest [2024-11-09 05:04:12,268 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:04:12,268 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:04:12,268 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:04:12,268 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:04:13,443 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 05:04:13,463 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:04:24,621 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13316#(and (not (= |ULTIMATE.start_dll_circular_destroy_~head#1.base| 0)) (= |ULTIMATE.start_dll_circular_destroy_~q~0#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_destroy_~head#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)) 0)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_destroy_~head#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)) 0) |ULTIMATE.start_dll_circular_destroy_~q~0#1.base|) (not (= |ULTIMATE.start_dll_circular_destroy_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_destroy_~head#1.base|) 0))) (= 1 (select |#valid| |ULTIMATE.start_dll_circular_destroy_~head#1.base|)) (<= (+ |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_destroy_~head#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_destroy_~head#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)) 1) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_destroy_~head#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (<= |#StackHeapBarrier| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_destroy_~head#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_destroy_~head#1.base|) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_204| Int) (|v_ULTIMATE.start_main_~len~0#1_20| Int)) (and (<= 1 |#StackHeapBarrier|) (= |v_ULTIMATE.start_main_~len~0#1_20| 2) (= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_129| Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_134| Int)) (and (<= 2 (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_134|) (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_129| 8))) (<= (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_129| 12) (select |#length| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_134|)) (<= 0 (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_129| 8)) (= (select |#valid| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_134|) 1) (<= (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_134|) (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_129| 8)) 3))) (= 2 |v_ULTIMATE.start_main_~i~0#1_204|))))' at error location [2024-11-09 05:04:24,621 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:04:24,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:04:24,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 38 [2024-11-09 05:04:24,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643939082] [2024-11-09 05:04:24,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:04:24,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 05:04:24,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:04:24,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 05:04:24,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=7461, Unknown=20, NotChecked=0, Total=7832 [2024-11-09 05:04:24,624 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 39 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:04:26,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:04:26,483 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2024-11-09 05:04:26,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 05:04:26,483 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 61 [2024-11-09 05:04:26,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:04:26,484 INFO L225 Difference]: With dead ends: 75 [2024-11-09 05:04:26,484 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 05:04:26,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 98 SyntacticMatches, 4 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2832 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=463, Invalid=9819, Unknown=20, NotChecked=0, Total=10302 [2024-11-09 05:04:26,486 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 44 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 05:04:26,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 692 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 05:04:26,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 05:04:26,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-09 05:04:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:04:26,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2024-11-09 05:04:26,489 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 61 [2024-11-09 05:04:26,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:04:26,489 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2024-11-09 05:04:26,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:04:26,490 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2024-11-09 05:04:26,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 05:04:26,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:04:26,491 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:04:26,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-11-09 05:04:26,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-09 05:04:26,691 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:04:26,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:04:26,692 INFO L85 PathProgramCache]: Analyzing trace with hash -626134102, now seen corresponding path program 1 times [2024-11-09 05:04:26,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:04:26,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498942461] [2024-11-09 05:04:26,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:04:26,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:04:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:04:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 05:04:27,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:04:27,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498942461] [2024-11-09 05:04:27,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498942461] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:04:27,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462585369] [2024-11-09 05:04:27,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:04:27,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:04:27,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:04:27,891 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:04:27,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-09 05:04:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:04:28,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-09 05:04:28,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:04:28,313 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 05:04:28,367 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:04:28,367 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 05:04:28,415 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 11 treesize of output 7 [2024-11-09 05:04:28,478 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 05:04:28,570 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 05:04:28,580 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 24 treesize of output 19 [2024-11-09 05:04:28,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:04:28,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:04:28,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:04:28,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2024-11-09 05:04:28,902 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:04:28,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2024-11-09 05:04:29,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:04:29,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 27 treesize of output 27 [2024-11-09 05:04:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 05:04:29,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:04:29,357 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4358 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4358) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2024-11-09 05:04:29,453 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4358 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_4358) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2024-11-09 05:04:29,467 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4357 (Array Int Int)) (v_ArrVal_4358 (Array Int Int))) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4357))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_4358)) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= v_ArrVal_4357 (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_4357 .cse1))))))) is different from false [2024-11-09 05:04:29,489 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4357 (Array Int Int)) (v_ArrVal_4358 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_159| Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_4357) (select v_ArrVal_4357 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_4358) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_159| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (= v_ArrVal_4357 (let ((.cse0 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_159|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 (select v_ArrVal_4357 .cse0))))))) is different from false [2024-11-09 05:04:29,515 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4357 (Array Int Int)) (v_ArrVal_4358 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_159| Int)) (or (not (= v_ArrVal_4357 (let ((.cse0 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_159|))) (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 (select v_ArrVal_4357 .cse0))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_159| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4357) (select v_ArrVal_4357 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_4358) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))))) is different from false [2024-11-09 05:04:29,534 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4355 (Array Int Int)) (v_ArrVal_4357 (Array Int Int)) (v_ArrVal_4358 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_159| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4355))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_159| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= v_ArrVal_4357 (let ((.cse1 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_159|))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_4357 .cse1))))) (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4357) (select v_ArrVal_4357 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_4358) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) is different from false [2024-11-09 05:04:29,566 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4355 (Array Int Int)) (v_ArrVal_4357 (Array Int Int)) (v_ArrVal_4358 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_159| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4355))) (or (not (= (let ((.cse1 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_159|))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_4357 .cse1))) v_ArrVal_4357)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_159| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4357) (select v_ArrVal_4357 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_4358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2024-11-09 05:04:29,584 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4354 (Array Int Int)) (v_ArrVal_4355 (Array Int Int)) (v_ArrVal_4357 (Array Int Int)) (v_ArrVal_4358 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_159| Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4354) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4355))) (or (not (= (let ((.cse1 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_159|))) (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_4357 .cse1))) v_ArrVal_4357)) (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4357) (select v_ArrVal_4357 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_4358) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_159| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2024-11-09 05:04:29,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:04:29,609 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 61 [2024-11-09 05:04:29,615 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 227 treesize of output 221 [2024-11-09 05:04:29,621 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:04:29,622 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:04:29,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:04:29,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 119 [2024-11-09 05:04:29,643 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:04:29,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:04:29,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 95 [2024-11-09 05:04:29,662 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:04:29,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:04:29,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 67 [2024-11-09 05:04:29,680 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 26 treesize of output 24 [2024-11-09 05:04:29,787 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:04:29,792 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:04:29,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:04:29,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 186 treesize of output 186 [2024-11-09 05:04:30,178 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:04:30,179 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:04:30,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:04:30,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 268 treesize of output 248 [2024-11-09 05:04:30,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:04:30,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 69 [2024-11-09 05:04:31,329 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 9 not checked. [2024-11-09 05:04:31,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462585369] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:04:31,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1907144919] [2024-11-09 05:04:31,331 INFO L159 IcfgInterpreter]: Started Sifa with 43 locations of interest [2024-11-09 05:04:31,331 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:04:31,331 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:04:31,331 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:04:31,332 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:04:32,462 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 05:04:32,490 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:04:54,066 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13950#(and (exists ((|v_ULTIMATE.start_main_old_#valid#1_10| (Array Int Int))) (not (= |v_ULTIMATE.start_main_old_#valid#1_10| |#valid|))) (exists ((|v_ULTIMATE.start_main_~i~0#1_220| Int) (|v_ULTIMATE.start_main_~len~0#1_21| Int) (|v_#valid_289| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_destroy_~head#1.base_25| Int)) (and (<= 1 |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_dll_circular_destroy_~head#1.base_25| 0)) (<= (+ |v_ULTIMATE.start_dll_circular_destroy_~head#1.base_25| 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_destroy_~head#1.base_25|) 0) |v_ULTIMATE.start_dll_circular_destroy_~head#1.base_25|) (= |v_ULTIMATE.start_main_~len~0#1_21| 2) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_destroy_~head#1.base_25|) 0) 0) (exists ((|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_147| Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_142| Int)) (and (<= 2 (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_147|) (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_142| 8))) (<= (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_147|) (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_142| 8)) 3) (<= (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_142| 12) (select |#length| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_147|)) (<= 0 (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_142| 8)) (= (select |v_#valid_289| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_147|) 1))) (= |#valid| (store |v_#valid_289| |v_ULTIMATE.start_dll_circular_destroy_~head#1.base_25| 0)) (= 1 (select |v_#valid_289| |v_ULTIMATE.start_dll_circular_destroy_~head#1.base_25|)) (= 2 |v_ULTIMATE.start_main_~i~0#1_220|) (<= 4 (select |#length| |v_ULTIMATE.start_dll_circular_destroy_~head#1.base_25|)))) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2024-11-09 05:04:54,066 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:04:54,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:04:54,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 24] total 57 [2024-11-09 05:04:54,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349423068] [2024-11-09 05:04:54,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:04:54,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-09 05:04:54,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:04:54,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-09 05:04:54,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=7001, Unknown=25, NotChecked=1400, Total=8742 [2024-11-09 05:04:54,070 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 57 states, 53 states have (on average 2.6226415094339623) internal successors, (139), 51 states have internal predecessors, (139), 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 05:04:56,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:04:56,450 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2024-11-09 05:04:56,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 05:04:56,450 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 53 states have (on average 2.6226415094339623) internal successors, (139), 51 states have internal predecessors, (139), 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 62 [2024-11-09 05:04:56,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:04:56,451 INFO L225 Difference]: With dead ends: 73 [2024-11-09 05:04:56,451 INFO L226 Difference]: Without dead ends: 73 [2024-11-09 05:04:56,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 114 SyntacticMatches, 9 SemanticMatches, 102 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2724 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=395, Invalid=8732, Unknown=25, NotChecked=1560, Total=10712 [2024-11-09 05:04:56,453 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 93 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 507 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:04:56,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 795 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1134 Invalid, 0 Unknown, 507 Unchecked, 1.3s Time] [2024-11-09 05:04:56,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-09 05:04:56,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-11-09 05:04:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 68 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:04:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2024-11-09 05:04:56,456 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 62 [2024-11-09 05:04:56,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:04:56,457 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2024-11-09 05:04:56,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 53 states have (on average 2.6226415094339623) internal successors, (139), 51 states have internal predecessors, (139), 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 05:04:56,457 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2024-11-09 05:04:56,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 05:04:56,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:04:56,458 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:04:56,481 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-11-09 05:04:56,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2024-11-09 05:04:56,659 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2024-11-09 05:04:56,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:04:56,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1955319001, now seen corresponding path program 1 times [2024-11-09 05:04:56,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:04:56,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367260520] [2024-11-09 05:04:56,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:04:56,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:04:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:04:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 05:04:58,820 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:04:58,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367260520] [2024-11-09 05:04:58,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367260520] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:04:58,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531045227] [2024-11-09 05:04:58,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:04:58,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:04:58,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:04:58,822 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:04:58,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_898abf26-2d3d-4768-bf51-1979e8ec5ab8/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-09 05:04:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:04:59,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-09 05:04:59,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:04:59,301 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 05:04:59,509 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:04:59,509 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 05:04:59,646 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 11 treesize of output 7 [2024-11-09 05:04:59,652 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 11 treesize of output 7 [2024-11-09 05:04:59,749 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 05:04:59,756 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 05:04:59,938 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 19 treesize of output 18 [2024-11-09 05:04:59,948 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 19 treesize of output 18 [2024-11-09 05:05:00,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:05:00,070 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-09 05:05:00,070 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 80 treesize of output 57 [2024-11-09 05:05:00,076 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 0 case distinctions, treesize of input 64 treesize of output 56 [2024-11-09 05:05:00,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:05:00,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:05:00,493 INFO L349 Elim1Store]: treesize reduction 61, result has 10.3 percent of original size [2024-11-09 05:05:00,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 63 [2024-11-09 05:05:00,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:05:00,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:05:00,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2024-11-09 05:05:01,198 INFO L349 Elim1Store]: treesize reduction 188, result has 12.6 percent of original size [2024-11-09 05:05:01,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 171 treesize of output 103 [2024-11-09 05:05:01,222 INFO L349 Elim1Store]: treesize reduction 35, result has 23.9 percent of original size [2024-11-09 05:05:01,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 56 [2024-11-09 05:05:02,036 INFO L349 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2024-11-09 05:05:02,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 58 [2024-11-09 05:05:02,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:05:02,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 21 [2024-11-09 05:05:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 05:05:02,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:06:10,559 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse9 (store (select .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_171| Int)) (or (forall ((v_ArrVal_4525 (Array Int Int))) (let ((.cse2 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_171|))) (or (forall ((v_ArrVal_4524 (Array Int Int))) (or (not (= v_ArrVal_4524 (store (store .cse0 .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) .cse2 (select v_ArrVal_4524 .cse2)))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_169| Int)) (or (forall ((v_ArrVal_4527 (Array Int Int))) (let ((.cse6 (store .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4524)) (.cse4 (select v_ArrVal_4525 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse5 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_169|))) (or (forall ((v_ArrVal_4526 (Array Int Int))) (let ((.cse3 (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4525))) (or (not (= v_ArrVal_4526 (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4526 .cse5)))) (= (select (select (store .cse6 .cse4 v_ArrVal_4527) (select (select (store .cse3 .cse4 v_ArrVal_4526) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (not (= (store (select .cse6 .cse4) .cse5 (select v_ArrVal_4527 .cse5)) v_ArrVal_4527))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_169| (select v_ArrVal_4524 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (not (= (store .cse9 .cse2 (select v_ArrVal_4525 .cse2)) v_ArrVal_4525))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_171| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_171| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_169| Int) (v_ArrVal_4525 (Array Int Int)) (v_ArrVal_4526 (Array Int Int))) (let ((.cse10 (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4525)) (.cse11 (select v_ArrVal_4525 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_169| (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= v_ArrVal_4526 (let ((.cse12 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_169|))) (store (select .cse10 .cse11) .cse12 (select v_ArrVal_4526 .cse12))))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (let ((.cse13 (store .cse10 .cse11 v_ArrVal_4526))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_171| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= (let ((.cse14 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_171|))) (store .cse9 .cse14 (select v_ArrVal_4525 .cse14))) v_ArrVal_4525)))))))) is different from false [2024-11-09 05:06:11,327 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (.cse9 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse0 (store (select .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_171| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_171| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_4525 (Array Int Int))) (let ((.cse1 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_171|))) (or (not (= v_ArrVal_4525 (store .cse0 .cse1 (select v_ArrVal_4525 .cse1)))) (forall ((v_ArrVal_4524 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_169| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_169| (select v_ArrVal_4524 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (forall ((v_ArrVal_4527 (Array Int Int))) (let ((.cse2 (store .cse7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4524)) (.cse3 (select v_ArrVal_4525 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse4 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_169|))) (or (not (= (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4527 .cse4)) v_ArrVal_4527)) (forall ((v_ArrVal_4526 (Array Int Int))) (let ((.cse5 (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4525))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (store .cse2 .cse3 v_ArrVal_4527) (select (select (store .cse5 .cse3 v_ArrVal_4526) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 0)) (not (= v_ArrVal_4526 (store (select .cse5 .cse3) .cse4 (select v_ArrVal_4526 .cse4)))))))))))) (not (= (store (store .cse8 .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) .cse1 (select v_ArrVal_4524 .cse1)) v_ArrVal_4524))))))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_171| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_169| Int) (v_ArrVal_4525 (Array Int Int)) (v_ArrVal_4526 (Array Int Int))) (let ((.cse11 (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4525)) (.cse12 (select v_ArrVal_4525 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_169| (select .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (= (select (let ((.cse10 (store .cse11 .cse12 v_ArrVal_4526))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_171| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_ArrVal_4525 (let ((.cse13 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_171|))) (store .cse0 .cse13 (select v_ArrVal_4525 .cse13))))) (not (= v_ArrVal_4526 (let ((.cse14 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_169|))) (store (select .cse11 .cse12) .cse14 (select v_ArrVal_4526 .cse14))))))))))) is different from false [2024-11-09 05:06:11,861 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_171| Int) (v_ArrVal_4517 (Array Int Int)) (v_ArrVal_4518 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_171| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_4525 (Array Int Int))) (let ((.cse4 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4517))) (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (.cse7 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_171|))) (or (forall ((v_ArrVal_4524 (Array Int Int))) (let ((.cse5 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4518))) (store .cse8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) (or (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_169| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_169| (select v_ArrVal_4524 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (forall ((v_ArrVal_4527 (Array Int Int))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4524)) (.cse1 (select v_ArrVal_4525 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse3 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_169|))) (or (forall ((v_ArrVal_4526 (Array Int Int))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4525))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (store .cse0 .cse1 v_ArrVal_4527) (select (select (store .cse2 .cse1 v_ArrVal_4526) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 0)) (not (= v_ArrVal_4526 (store (select .cse2 .cse1) .cse3 (select v_ArrVal_4526 .cse3))))))) (not (= v_ArrVal_4527 (store (select .cse0 .cse1) .cse3 (select v_ArrVal_4527 .cse3))))))))) (not (= (store (store (select .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) .cse7 (select v_ArrVal_4524 .cse7)) v_ArrVal_4524))))) (not (= v_ArrVal_4525 (store (store (select .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse7 (select v_ArrVal_4525 .cse7))))))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_171| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_169| Int) (v_ArrVal_4525 (Array Int Int)) (v_ArrVal_4526 (Array Int Int)) (v_ArrVal_4517 (Array Int Int)) (v_ArrVal_4518 (Array Int Int))) (let ((.cse14 (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4517))) (store .cse17 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse17 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse10 (store .cse14 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_4525)) (.cse11 (select v_ArrVal_4525 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_171| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_ArrVal_4526 (let ((.cse12 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_169|))) (store (select .cse10 .cse11) .cse12 (select v_ArrVal_4526 .cse12))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_169| (select (select (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4518))) (store .cse13 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= v_ArrVal_4525 (let ((.cse15 (+ 8 |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_171|))) (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse15 (select v_ArrVal_4525 .cse15))))) (= (select (let ((.cse16 (store .cse10 .cse11 v_ArrVal_4526))) (select .cse16 (select (select .cse16 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))))) is different from false [2024-11-09 05:06:13,485 INFO L349 Elim1Store]: treesize reduction 46, result has 56.6 percent of original size [2024-11-09 05:06:13,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 10623 treesize of output 10154 [2024-11-09 05:06:14,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:06:14,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1577 treesize of output 1603 [2024-11-09 05:06:14,502 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:06:14,606 INFO L224 Elim1Store]: Index analysis took 286 ms [2024-11-09 05:06:15,958 INFO L349 Elim1Store]: treesize reduction 228, result has 36.1 percent of original size [2024-11-09 05:06:15,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 1556 treesize of output 1755 [2024-11-09 05:06:16,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:06:16,217 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2024-11-09 05:06:16,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:06:16,469 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 136 [2024-11-09 05:06:16,677 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 162 treesize of output 154 [2024-11-09 05:06:20,902 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 13 treesize of output 1 [2024-11-09 05:06:30,579 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 145 treesize of output 137 [2024-11-09 05:06:32,669 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 05:06:35,406 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 13 treesize of output 1 [2024-11-09 05:12:31,101 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 6 treesize of output 4 [2024-11-09 05:12:38,885 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 6 treesize of output 4 [2024-11-09 05:12:39,733 INFO L349 Elim1Store]: treesize reduction 13, result has 31.6 percent of original size [2024-11-09 05:12:39,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 8889 treesize of output 8694 [2024-11-09 05:13:03,989 INFO L349 Elim1Store]: treesize reduction 82, result has 42.3 percent of original size [2024-11-09 05:13:03,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 9004 treesize of output 8748 [2024-11-09 05:13:17,036 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:13:17,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-09 05:13:18,162 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:13:18,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-09 05:13:18,699 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:13:18,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-09 05:13:54,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:13:54,976 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 1 case distinctions, treesize of input 7 treesize of output 6 [2024-11-09 05:13:56,514 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2024-11-09 05:13:56,516 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 4751 treesize of output 4747 [2024-11-09 05:14:11,106 INFO L349 Elim1Store]: treesize reduction 16, result has 66.7 percent of original size [2024-11-09 05:14:11,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17652 treesize of output 17686 [2024-11-09 05:14:18,272 INFO L224 Elim1Store]: Index analysis took 2038 ms [2024-11-09 05:14:22,386 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-09 05:14:22,387 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 2 case distinctions, treesize of input 25 treesize of output 4