./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.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_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/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_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/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_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/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 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:00:44,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:00:44,162 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 06:00:44,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:00:44,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:00:44,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:00:44,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:00:44,205 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:00:44,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:00:44,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:00:44,207 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:00:44,207 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:00:44,208 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:00:44,208 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:00:44,208 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:00:44,211 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:00:44,212 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:00:44,212 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:00:44,212 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:00:44,213 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:00:44,213 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:00:44,217 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:00:44,218 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:00:44,218 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:00:44,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:00:44,219 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:00:44,219 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:00:44,219 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:00:44,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:00:44,220 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 06:00:44,220 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 06:00:44,221 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 06:00:44,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:00:44,224 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:00:44,224 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:00:44,224 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:00:44,225 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:00:44,225 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:00:44,225 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:00:44,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:00:44,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:00:44,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:00:44,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:00:44,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:00:44,226 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:00:44,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:00:44,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:00:44,227 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:00:44,228 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:00:44,228 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_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/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_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/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 -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2024-11-09 06:00:44,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:00:44,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:00:44,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:00:44,589 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:00:44,590 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:00:44,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i Unable to find full path for "g++" [2024-11-09 06:00:46,610 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:00:46,855 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:00:46,856 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2024-11-09 06:00:46,877 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/data/2534d35ef/7aeee86fce2a44d8a2ae44a8c3c48566/FLAG90b980d5a [2024-11-09 06:00:46,891 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/data/2534d35ef/7aeee86fce2a44d8a2ae44a8c3c48566 [2024-11-09 06:00:46,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:00:46,895 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:00:46,897 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:00:46,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:00:46,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:00:46,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:00:46" (1/1) ... [2024-11-09 06:00:46,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a307ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:00:46, skipping insertion in model container [2024-11-09 06:00:46,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:00:46" (1/1) ... [2024-11-09 06:00:46,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:00:47,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:00:47,343 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:00:47,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:00:47,463 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:00:47,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:00:47 WrapperNode [2024-11-09 06:00:47,464 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:00:47,465 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:00:47,466 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:00:47,466 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:00:47,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:00:47" (1/1) ... [2024-11-09 06:00:47,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:00:47" (1/1) ... [2024-11-09 06:00:47,535 INFO L138 Inliner]: procedures = 127, calls = 54, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 160 [2024-11-09 06:00:47,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:00:47,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:00:47,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:00:47,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:00:47,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:00:47" (1/1) ... [2024-11-09 06:00:47,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:00:47" (1/1) ... [2024-11-09 06:00:47,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:00:47" (1/1) ... [2024-11-09 06:00:47,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:00:47" (1/1) ... [2024-11-09 06:00:47,576 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:00:47" (1/1) ... [2024-11-09 06:00:47,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:00:47" (1/1) ... [2024-11-09 06:00:47,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:00:47" (1/1) ... [2024-11-09 06:00:47,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:00:47" (1/1) ... [2024-11-09 06:00:47,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:00:47,599 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:00:47,599 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:00:47,601 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:00:47,602 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:00:47" (1/1) ... [2024-11-09 06:00:47,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:00:47,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:00:47,639 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:00:47,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:00:47,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:00:47,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:00:47,676 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 06:00:47,677 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 06:00:47,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:00:47,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:00:47,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:00:47,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 06:00:47,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 06:00:47,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:00:47,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 06:00:47,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:00:47,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:00:47,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:00:47,820 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:00:47,823 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:00:48,403 INFO L? ?]: Removed 178 outVars from TransFormulas that were not future-live. [2024-11-09 06:00:48,404 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:00:48,453 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:00:48,453 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 06:00:48,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:00:48 BoogieIcfgContainer [2024-11-09 06:00:48,454 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:00:48,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:00:48,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:00:48,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:00:48,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:00:46" (1/3) ... [2024-11-09 06:00:48,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71eaf879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:00:48, skipping insertion in model container [2024-11-09 06:00:48,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:00:47" (2/3) ... [2024-11-09 06:00:48,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71eaf879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:00:48, skipping insertion in model container [2024-11-09 06:00:48,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:00:48" (3/3) ... [2024-11-09 06:00:48,463 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2024-11-09 06:00:48,482 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:00:48,483 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2024-11-09 06:00:48,531 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:00:48,537 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;@1136fab4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:00:48,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2024-11-09 06:00:48,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 66 states have (on average 2.3333333333333335) internal successors, (154), 138 states have internal predecessors, (154), 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 06:00:48,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 06:00:48,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:00:48,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 06:00:48,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:00:48,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:00:48,556 INFO L85 PathProgramCache]: Analyzing trace with hash 274296848, now seen corresponding path program 1 times [2024-11-09 06:00:48,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:00:48,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632256626] [2024-11-09 06:00:48,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:00:48,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:00:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:00:48,856 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 06:00:48,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:00:48,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632256626] [2024-11-09 06:00:48,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632256626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:00:48,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:00:48,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:00:48,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682649103] [2024-11-09 06:00:48,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:00:48,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:00:48,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:00:48,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:00:48,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:00:48,900 INFO L87 Difference]: Start difference. First operand has 143 states, 66 states have (on average 2.3333333333333335) internal successors, (154), 138 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:00:49,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:00:49,115 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2024-11-09 06:00:49,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:00:49,118 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 06:00:49,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:00:49,127 INFO L225 Difference]: With dead ends: 139 [2024-11-09 06:00:49,127 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 06:00:49,129 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 06:00:49,132 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 2 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:00:49,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 209 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:00:49,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 06:00:49,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-09 06:00:49,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 64 states have (on average 2.25) internal successors, (144), 132 states have internal predecessors, (144), 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 06:00:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2024-11-09 06:00:49,178 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 5 [2024-11-09 06:00:49,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:00:49,178 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2024-11-09 06:00:49,179 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 06:00:49,179 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2024-11-09 06:00:49,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 06:00:49,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:00:49,180 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 06:00:49,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:00:49,180 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:00:49,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:00:49,181 INFO L85 PathProgramCache]: Analyzing trace with hash 274296849, now seen corresponding path program 1 times [2024-11-09 06:00:49,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:00:49,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627691766] [2024-11-09 06:00:49,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:00:49,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:00:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:00:49,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:00:49,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:00:49,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627691766] [2024-11-09 06:00:49,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627691766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:00:49,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:00:49,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:00:49,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252416248] [2024-11-09 06:00:49,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:00:49,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:00:49,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:00:49,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:00:49,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:00:49,389 INFO L87 Difference]: Start difference. First operand 137 states and 150 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 06:00:49,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:00:49,583 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2024-11-09 06:00:49,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:00:49,584 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 06:00:49,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:00:49,586 INFO L225 Difference]: With dead ends: 134 [2024-11-09 06:00:49,586 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 06:00:49,587 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 06:00:49,589 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 2 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:00:49,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 213 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:00:49,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 06:00:49,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-09 06:00:49,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 64 states have (on average 2.203125) internal successors, (141), 129 states have internal predecessors, (141), 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 06:00:49,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 147 transitions. [2024-11-09 06:00:49,611 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 147 transitions. Word has length 5 [2024-11-09 06:00:49,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:00:49,611 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 147 transitions. [2024-11-09 06:00:49,612 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 06:00:49,612 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 147 transitions. [2024-11-09 06:00:49,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:00:49,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:00:49,613 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:00:49,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:00:49,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:00:49,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:00:49,614 INFO L85 PathProgramCache]: Analyzing trace with hash 399471363, now seen corresponding path program 1 times [2024-11-09 06:00:49,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:00:49,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002521432] [2024-11-09 06:00:49,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:00:49,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:00:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:00:49,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:00:49,746 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:00:49,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002521432] [2024-11-09 06:00:49,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002521432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:00:49,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:00:49,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:00:49,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218709802] [2024-11-09 06:00:49,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:00:49,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:00:49,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:00:49,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:00:49,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:00:49,750 INFO L87 Difference]: Start difference. First operand 134 states and 147 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 06:00:49,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:00:49,860 INFO L93 Difference]: Finished difference Result 146 states and 161 transitions. [2024-11-09 06:00:49,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:00:49,861 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 06:00:49,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:00:49,863 INFO L225 Difference]: With dead ends: 146 [2024-11-09 06:00:49,865 INFO L226 Difference]: Without dead ends: 146 [2024-11-09 06:00:49,866 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 06:00:49,868 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 11 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:00:49,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 256 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:00:49,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-09 06:00:49,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 136. [2024-11-09 06:00:49,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 66 states have (on average 2.1666666666666665) internal successors, (143), 131 states have internal predecessors, (143), 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 06:00:49,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2024-11-09 06:00:49,893 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 11 [2024-11-09 06:00:49,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:00:49,893 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2024-11-09 06:00:49,893 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 06:00:49,894 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2024-11-09 06:00:49,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 06:00:49,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:00:49,898 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:00:49,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:00:49,899 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:00:49,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:00:49,900 INFO L85 PathProgramCache]: Analyzing trace with hash 551545094, now seen corresponding path program 1 times [2024-11-09 06:00:49,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:00:49,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584263725] [2024-11-09 06:00:49,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:00:49,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:00:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:00:50,155 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 06:00:50,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:00:50,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584263725] [2024-11-09 06:00:50,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584263725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:00:50,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:00:50,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:00:50,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416950460] [2024-11-09 06:00:50,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:00:50,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:00:50,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:00:50,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:00:50,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:00:50,159 INFO L87 Difference]: Start difference. First operand 136 states and 149 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 06:00:50,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:00:50,508 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2024-11-09 06:00:50,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:00:50,509 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 06:00:50,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:00:50,511 INFO L225 Difference]: With dead ends: 135 [2024-11-09 06:00:50,511 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 06:00:50,512 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 06:00:50,516 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 7 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:00:50,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 404 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:00:50,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 06:00:50,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-09 06:00:50,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 66 states have (on average 2.1515151515151514) internal successors, (142), 130 states have internal predecessors, (142), 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 06:00:50,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 148 transitions. [2024-11-09 06:00:50,525 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 148 transitions. Word has length 20 [2024-11-09 06:00:50,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:00:50,526 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 148 transitions. [2024-11-09 06:00:50,526 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 06:00:50,526 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 148 transitions. [2024-11-09 06:00:50,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 06:00:50,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:00:50,527 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:00:50,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:00:50,528 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:00:50,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:00:50,529 INFO L85 PathProgramCache]: Analyzing trace with hash 551545095, now seen corresponding path program 1 times [2024-11-09 06:00:50,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:00:50,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858689499] [2024-11-09 06:00:50,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:00:50,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:00:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:00:50,902 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 06:00:50,902 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:00:50,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858689499] [2024-11-09 06:00:50,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858689499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:00:50,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:00:50,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:00:50,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050599416] [2024-11-09 06:00:50,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:00:50,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:00:50,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:00:50,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:00:50,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:00:50,907 INFO L87 Difference]: Start difference. First operand 135 states and 148 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 06:00:51,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:00:51,201 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2024-11-09 06:00:51,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:00:51,202 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 06:00:51,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:00:51,203 INFO L225 Difference]: With dead ends: 134 [2024-11-09 06:00:51,203 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 06:00:51,204 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 06:00:51,204 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 6 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:00:51,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 428 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:00:51,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 06:00:51,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-09 06:00:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 66 states have (on average 2.1363636363636362) internal successors, (141), 129 states have internal predecessors, (141), 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 06:00:51,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 147 transitions. [2024-11-09 06:00:51,222 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 147 transitions. Word has length 20 [2024-11-09 06:00:51,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:00:51,222 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 147 transitions. [2024-11-09 06:00:51,223 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 06:00:51,226 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 147 transitions. [2024-11-09 06:00:51,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 06:00:51,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:00:51,227 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 06:00:51,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:00:51,228 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:00:51,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:00:51,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1753857639, now seen corresponding path program 1 times [2024-11-09 06:00:51,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:00:51,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338965109] [2024-11-09 06:00:51,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:00:51,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:00:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:00:51,564 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 06:00:51,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:00:51,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338965109] [2024-11-09 06:00:51,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338965109] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:00:51,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638096022] [2024-11-09 06:00:51,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:00:51,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:00:51,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:00:51,568 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:00:51,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:00:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:00:51,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 06:00:51,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:00:51,777 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 06:00:51,879 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 06:00:51,880 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 06:00:51,949 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 06:00:51,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:00:52,394 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 06:00:52,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638096022] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:00:52,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1271593197] [2024-11-09 06:00:52,419 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 06:00:52,419 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:00:52,424 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:00:52,431 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:00:52,431 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:00:53,742 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 06:00:54,672 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:01:08,760 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1675#(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) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~data~0#1| 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)) (exists ((|v_#memory_$Pointer$.offset_121| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_121| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_121| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 0)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#memory_int_97| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_97| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_97| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))))) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.base_121| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_121| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_121| |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))))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-09 06:01:08,761 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:01:08,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:01:08,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2024-11-09 06:01:08,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154499179] [2024-11-09 06:01:08,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:01:08,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 06:01:08,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:01:08,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 06:01:08,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=800, Unknown=2, NotChecked=0, Total=930 [2024-11-09 06:01:08,764 INFO L87 Difference]: Start difference. First operand 134 states and 147 transitions. Second operand has 18 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 06:01:09,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:01:09,911 INFO L93 Difference]: Finished difference Result 139 states and 155 transitions. [2024-11-09 06:01:09,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:01:09,912 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 22 [2024-11-09 06:01:09,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:01:09,914 INFO L225 Difference]: With dead ends: 139 [2024-11-09 06:01:09,914 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 06:01:09,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=137, Invalid=853, Unknown=2, NotChecked=0, Total=992 [2024-11-09 06:01:09,916 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 1 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:01:09,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 652 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 06:01:09,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 06:01:09,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-09 06:01:09,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 70 states have (on average 2.1) internal successors, (147), 133 states have internal predecessors, (147), 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 06:01:09,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 155 transitions. [2024-11-09 06:01:09,925 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 155 transitions. Word has length 22 [2024-11-09 06:01:09,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:01:09,925 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 155 transitions. [2024-11-09 06:01:09,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 06:01:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 155 transitions. [2024-11-09 06:01:09,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 06:01:09,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:01:09,927 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 06:01:09,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:01:10,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:01:10,131 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:01:10,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:01:10,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1753857640, now seen corresponding path program 1 times [2024-11-09 06:01:10,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:01:10,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430500904] [2024-11-09 06:01:10,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:01:10,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:01:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:01:10,741 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 06:01:10,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:01:10,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430500904] [2024-11-09 06:01:10,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430500904] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:01:10,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118605679] [2024-11-09 06:01:10,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:01:10,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:01:10,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:01:10,745 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:01:10,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:01:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:01:10,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 06:01:10,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:01:10,893 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 06:01:10,906 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 06:01:11,130 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:01:11,130 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 06:01:11,141 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 06:01:11,203 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 06:01:11,203 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:01:11,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118605679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:01:11,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [421289347] [2024-11-09 06:01:11,576 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 06:01:11,576 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:01:11,576 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:01:11,577 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:01:11,577 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:01:12,390 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 06:01:13,090 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:01:27,688 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2061#(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|) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (<= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) 7) (= |ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#memory_$Pointer$.base_135| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_135| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_135| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))))) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#memory_int_111| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_111| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_111| |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_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_135| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_135| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 0)))) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-09 06:01:27,688 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:01:27,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:01:27,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2024-11-09 06:01:27,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974294320] [2024-11-09 06:01:27,689 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:01:27,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 06:01:27,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:01:27,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 06:01:27,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=666, Unknown=2, NotChecked=0, Total=756 [2024-11-09 06:01:27,691 INFO L87 Difference]: Start difference. First operand 139 states and 155 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 06:01:29,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:01:29,404 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2024-11-09 06:01:29,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:01:29,405 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 06:01:29,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:01:29,406 INFO L225 Difference]: With dead ends: 139 [2024-11-09 06:01:29,407 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 06:01:29,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=103, Invalid=765, Unknown=2, NotChecked=0, Total=870 [2024-11-09 06:01:29,408 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:01:29,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 641 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 06:01:29,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 06:01:29,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-09 06:01:29,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 70 states have (on average 2.085714285714286) internal successors, (146), 133 states have internal predecessors, (146), 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 06:01:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2024-11-09 06:01:29,421 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 22 [2024-11-09 06:01:29,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:01:29,421 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2024-11-09 06:01:29,422 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 06:01:29,422 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2024-11-09 06:01:29,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 06:01:29,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:01:29,422 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 06:01:29,453 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 06:01:29,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:01:29,624 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:01:29,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:01:29,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1830165770, now seen corresponding path program 1 times [2024-11-09 06:01:29,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:01:29,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480597969] [2024-11-09 06:01:29,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:01:29,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:01:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:01:29,790 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 06:01:29,791 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:01:29,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480597969] [2024-11-09 06:01:29,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480597969] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:01:29,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960985903] [2024-11-09 06:01:29,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:01:29,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:01:29,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:01:29,793 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:01:29,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:01:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:01:29,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 06:01:29,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:01:29,970 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 06:01:29,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:01:30,043 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 06:01:30,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960985903] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:01:30,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1972821688] [2024-11-09 06:01:30,046 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 06:01:30,046 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:01:30,047 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:01:30,047 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:01:30,047 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:01:30,972 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 06:01:31,431 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:01:50,278 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2500#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_20| Int)) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_20|) 1))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-09 06:01:50,278 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:01:50,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:01:50,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-09 06:01:50,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372786370] [2024-11-09 06:01:50,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:01:50,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:01:50,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:01:50,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:01:50,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=360, Unknown=4, NotChecked=0, Total=420 [2024-11-09 06:01:50,281 INFO L87 Difference]: Start difference. First operand 139 states and 154 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 06:01:50,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:01:50,488 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2024-11-09 06:01:50,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:01:50,489 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 06:01:50,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:01:50,490 INFO L225 Difference]: With dead ends: 139 [2024-11-09 06:01:50,491 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 06:01:50,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=56, Invalid=360, Unknown=4, NotChecked=0, Total=420 [2024-11-09 06:01:50,492 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:01:50,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 611 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:01:50,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 06:01:50,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-09 06:01:50,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 70 states have (on average 2.0714285714285716) internal successors, (145), 133 states have internal predecessors, (145), 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 06:01:50,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2024-11-09 06:01:50,499 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 24 [2024-11-09 06:01:50,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:01:50,500 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2024-11-09 06:01:50,500 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 06:01:50,500 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2024-11-09 06:01:50,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 06:01:50,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:01:50,501 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 06:01:50,526 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 06:01:50,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:01:50,703 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:01:50,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:01:50,703 INFO L85 PathProgramCache]: Analyzing trace with hash 895765689, now seen corresponding path program 1 times [2024-11-09 06:01:50,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:01:50,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653614760] [2024-11-09 06:01:50,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:01:50,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:01:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:01:50,843 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 06:01:50,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:01:50,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653614760] [2024-11-09 06:01:50,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653614760] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:01:50,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563126224] [2024-11-09 06:01:50,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:01:50,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:01:50,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:01:50,848 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:01:50,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 06:01:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:01:50,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 06:01:50,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:01:50,992 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 06:01:51,135 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 06:01:51,205 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 06:01:51,205 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 06:01:51,233 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 06:01:51,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:01:51,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563126224] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:01:51,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [870597675] [2024-11-09 06:01:51,356 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 06:01:51,356 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:01:51,356 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:01:51,357 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:01:51,357 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:01:52,201 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 06:01:52,644 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:02:13,592 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2900#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (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_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-09 06:02:13,593 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:02:13,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:02:13,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2024-11-09 06:02:13,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310896007] [2024-11-09 06:02:13,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:02:13,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:02:13,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:02:13,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:02:13,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=570, Unknown=6, NotChecked=48, Total=702 [2024-11-09 06:02:13,595 INFO L87 Difference]: Start difference. First operand 139 states and 153 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 06:02:14,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:14,812 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2024-11-09 06:02:14,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:02:14,813 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 06:02:14,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:14,816 INFO L225 Difference]: With dead ends: 138 [2024-11-09 06:02:14,816 INFO L226 Difference]: Without dead ends: 138 [2024-11-09 06:02:14,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=95, Invalid=715, Unknown=6, NotChecked=54, Total=870 [2024-11-09 06:02:14,818 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 10 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:14,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 629 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 495 Invalid, 0 Unknown, 147 Unchecked, 1.0s Time] [2024-11-09 06:02:14,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-09 06:02:14,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-09 06:02:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 70 states have (on average 2.057142857142857) internal successors, (144), 132 states have internal predecessors, (144), 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 06:02:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2024-11-09 06:02:14,829 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 25 [2024-11-09 06:02:14,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:14,829 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2024-11-09 06:02:14,829 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 06:02:14,829 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2024-11-09 06:02:14,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 06:02:14,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:14,830 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 06:02:14,857 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 06:02:15,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:02:15,035 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:02:15,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:15,035 INFO L85 PathProgramCache]: Analyzing trace with hash 895765690, now seen corresponding path program 1 times [2024-11-09 06:02:15,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:15,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465923112] [2024-11-09 06:02:15,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:15,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:15,435 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 06:02:15,435 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:02:15,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465923112] [2024-11-09 06:02:15,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465923112] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:02:15,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128938389] [2024-11-09 06:02:15,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:15,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:02:15,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:02:15,438 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:02:15,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 06:02:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:15,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 06:02:15,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:02:15,594 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 06:02:15,603 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 06:02:15,890 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 06:02:15,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:02:15,936 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 06:02:15,956 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:02:15,956 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 06:02:16,042 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 06:02:16,042 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:02:16,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128938389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:02:16,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [51678916] [2024-11-09 06:02:16,285 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 06:02:16,285 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:02:16,285 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:02:16,286 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:02:16,286 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:02:17,295 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-09 06:02:17,903 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:02:33,030 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3311#(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_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-09 06:02:33,030 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:02:33,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:02:33,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-09 06:02:33,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514768074] [2024-11-09 06:02:33,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:02:33,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 06:02:33,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:02:33,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 06:02:33,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=887, Unknown=3, NotChecked=60, Total=1056 [2024-11-09 06:02:33,032 INFO L87 Difference]: Start difference. First operand 138 states and 152 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 06:02:34,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:34,395 INFO L93 Difference]: Finished difference Result 157 states and 178 transitions. [2024-11-09 06:02:34,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:02:34,395 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 06:02:34,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:34,397 INFO L225 Difference]: With dead ends: 157 [2024-11-09 06:02:34,398 INFO L226 Difference]: Without dead ends: 157 [2024-11-09 06:02:34,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=137, Invalid=1124, Unknown=3, NotChecked=68, Total=1332 [2024-11-09 06:02:34,399 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 20 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:34,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 779 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 514 Invalid, 0 Unknown, 173 Unchecked, 1.1s Time] [2024-11-09 06:02:34,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-09 06:02:34,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 150. [2024-11-09 06:02:34,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 81 states have (on average 2.0) internal successors, (162), 143 states have internal predecessors, (162), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 06:02:34,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 172 transitions. [2024-11-09 06:02:34,406 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 172 transitions. Word has length 25 [2024-11-09 06:02:34,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:34,406 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 172 transitions. [2024-11-09 06:02:34,406 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 06:02:34,407 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 172 transitions. [2024-11-09 06:02:34,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 06:02:34,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:34,407 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 06:02:34,430 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 06:02:34,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:02:34,612 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:02:34,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:34,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1998932588, now seen corresponding path program 1 times [2024-11-09 06:02:34,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:34,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386888369] [2024-11-09 06:02:34,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:34,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:34,844 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 06:02:34,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:02:34,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386888369] [2024-11-09 06:02:34,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386888369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:02:34,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:02:34,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:02:34,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927735233] [2024-11-09 06:02:34,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:02:34,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:02:34,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:02:34,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:02:34,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:02:34,849 INFO L87 Difference]: Start difference. First operand 150 states and 172 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 06:02:35,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:35,519 INFO L93 Difference]: Finished difference Result 149 states and 171 transitions. [2024-11-09 06:02:35,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:02:35,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-09 06:02:35,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:35,521 INFO L225 Difference]: With dead ends: 149 [2024-11-09 06:02:35,521 INFO L226 Difference]: Without dead ends: 149 [2024-11-09 06:02:35,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:02:35,522 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 8 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:35,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 471 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:02:35,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-09 06:02:35,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-09 06:02:35,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 81 states have (on average 1.9876543209876543) internal successors, (161), 142 states have internal predecessors, (161), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 06:02:35,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 171 transitions. [2024-11-09 06:02:35,528 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 171 transitions. Word has length 26 [2024-11-09 06:02:35,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:35,529 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 171 transitions. [2024-11-09 06:02:35,529 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 06:02:35,529 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2024-11-09 06:02:35,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 06:02:35,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:35,530 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 06:02:35,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:02:35,531 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:02:35,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:35,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1998932589, now seen corresponding path program 1 times [2024-11-09 06:02:35,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:35,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559312389] [2024-11-09 06:02:35,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:35,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:35,873 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 06:02:35,873 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:02:35,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559312389] [2024-11-09 06:02:35,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559312389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:02:35,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:02:35,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:02:35,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480948881] [2024-11-09 06:02:35,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:02:35,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:02:35,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:02:35,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:02:35,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:02:35,876 INFO L87 Difference]: Start difference. First operand 149 states and 171 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 06:02:36,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:36,591 INFO L93 Difference]: Finished difference Result 148 states and 170 transitions. [2024-11-09 06:02:36,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:02:36,591 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 06:02:36,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:36,593 INFO L225 Difference]: With dead ends: 148 [2024-11-09 06:02:36,593 INFO L226 Difference]: Without dead ends: 148 [2024-11-09 06:02:36,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:02:36,594 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 7 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:36,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 540 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:02:36,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-09 06:02:36,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-11-09 06:02:36,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 81 states have (on average 1.9753086419753085) internal successors, (160), 141 states have internal predecessors, (160), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 06:02:36,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 170 transitions. [2024-11-09 06:02:36,601 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 170 transitions. Word has length 26 [2024-11-09 06:02:36,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:36,602 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 170 transitions. [2024-11-09 06:02:36,602 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 06:02:36,602 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 170 transitions. [2024-11-09 06:02:36,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 06:02:36,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:36,606 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:02:36,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:02:36,607 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:02:36,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:36,607 INFO L85 PathProgramCache]: Analyzing trace with hash -23127194, now seen corresponding path program 1 times [2024-11-09 06:02:36,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:36,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25469203] [2024-11-09 06:02:36,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:36,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:37,375 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 06:02:37,375 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:02:37,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25469203] [2024-11-09 06:02:37,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25469203] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:02:37,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135838797] [2024-11-09 06:02:37,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:37,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:02:37,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:02:37,381 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:02:37,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 06:02:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:37,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 06:02:37,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:02:37,582 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 06:02:37,639 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 06:02:37,660 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-09 06:02:37,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:02:37,725 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 06:02:37,760 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 06:02:37,810 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 06:02:37,811 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 06:02:37,921 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 06:02:37,921 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 06:02:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 10 not checked. [2024-11-09 06:02:37,959 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:02:38,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135838797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:02:38,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1196439086] [2024-11-09 06:02:38,510 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-09 06:02:38,510 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:02:38,511 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:02:38,511 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:02:38,512 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:02:39,521 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 06:02:39,550 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:02:51,368 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4451#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (= |ULTIMATE.start_dll_circular_insert_~index#1| 1) (= |ULTIMATE.start_dll_circular_insert_~data#1| 1) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_30| Int)) (and (or (and (exists ((|v_#memory_$Pointer$.offset_227| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_227| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_227| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8))))) (exists ((|v_#memory_$Pointer$.base_227| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_227| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_227| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8))) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 0)) (exists ((|v_#memory_int_203| (Array Int (Array Int Int))) (|v_#memory_int_204| (Array Int (Array Int Int))) (|v_#memory_int_205| (Array Int (Array Int Int)))) (and (= |v_#memory_int_204| (store |v_#memory_int_203| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_203| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_204| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0)))) (= |#memory_int| (store |v_#memory_int_205| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_205| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8 1))) (= (store |v_#memory_int_204| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_204| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_205| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4))) |v_#memory_int_205|))) (exists ((|v_#length_177| (Array Int Int))) (= |#length| (store |v_#length_177| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 12))) (exists ((|v_#memory_int_209| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_45| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#memory_int_210| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_74| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_233| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_233| (Array Int (Array Int Int)))) (and (<= 8 (select |v_old(#length)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select (select (store (store |v_#memory_$Pointer$.offset_233| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_233| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_233| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_233| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= (store |v_#memory_int_209| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_209| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_210| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_210|) (= (store |v_#memory_int_210| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_210| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_#memory_int_BEFORE_CALL_74| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_#memory_int_BEFORE_CALL_74|) (<= 4 (select |v_old(#length)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (store (store |v_#memory_$Pointer$.base_233| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_233| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_233| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_233| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))))) (exists ((|v_#valid_209| (Array Int Int))) (and (= (select |v_#valid_209| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= |#valid| (store |v_#valid_209| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 1)))) (<= (+ |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_30|)) (and (exists ((|v_#memory_int_209| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_#memory_int_210| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_76| (Array Int Int)) (|v_#memory_$Pointer$.base_233| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_44| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_233| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (store |v_#memory_int_209| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_209| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_210| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_210|) (= (select (select (store (store |v_#memory_$Pointer$.offset_233| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_233| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_233| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_233| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 8 (select |v_#length_BEFORE_CALL_76| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (store (store |v_#memory_$Pointer$.base_233| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_233| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_233| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_233| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= |v_old(#memory_int)_AFTER_CALL_44| (store |v_#memory_int_210| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_210| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select |v_old(#valid)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (<= 4 (select |v_#length_BEFORE_CALL_76| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))))) (exists ((|v_#memory_$Pointer$.offset_227| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_227| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_227| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8))))) (exists ((|v_#memory_$Pointer$.base_227| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_227| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_227| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8))) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 0)) (exists ((|v_#memory_int_203| (Array Int (Array Int Int))) (|v_#memory_int_204| (Array Int (Array Int Int))) (|v_#memory_int_205| (Array Int (Array Int Int)))) (and (= |v_#memory_int_204| (store |v_#memory_int_203| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_203| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_204| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0)))) (= |#memory_int| (store |v_#memory_int_205| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_205| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8 1))) (= (store |v_#memory_int_204| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_204| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_205| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4))) |v_#memory_int_205|))) (exists ((|v_#length_177| (Array Int Int))) (= |#length| (store |v_#length_177| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 12))) (exists ((|v_#valid_209| (Array Int Int))) (and (= (select |v_#valid_209| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= |#valid| (store |v_#valid_209| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 1)))) (<= (+ |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_30|))) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_30|) 1)))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 06:02:51,369 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:02:51,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:02:51,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2024-11-09 06:02:51,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755531365] [2024-11-09 06:02:51,369 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:02:51,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 06:02:51,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:02:51,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 06:02:51,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=953, Unknown=4, NotChecked=126, Total=1190 [2024-11-09 06:02:51,371 INFO L87 Difference]: Start difference. First operand 148 states and 170 transitions. Second operand has 13 states, 9 states have (on average 4.222222222222222) internal successors, (38), 11 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 06:02:52,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:52,549 INFO L93 Difference]: Finished difference Result 157 states and 181 transitions. [2024-11-09 06:02:52,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:02:52,550 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 4.222222222222222) internal successors, (38), 11 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 35 [2024-11-09 06:02:52,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:52,551 INFO L225 Difference]: With dead ends: 157 [2024-11-09 06:02:52,551 INFO L226 Difference]: Without dead ends: 157 [2024-11-09 06:02:52,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 72 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=127, Invalid=1137, Unknown=4, NotChecked=138, Total=1406 [2024-11-09 06:02:52,553 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 161 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 296 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:52,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 335 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 452 Invalid, 0 Unknown, 296 Unchecked, 0.9s Time] [2024-11-09 06:02:52,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-09 06:02:52,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 138. [2024-11-09 06:02:52,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 81 states have (on average 1.8518518518518519) internal successors, (150), 131 states have internal predecessors, (150), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 06:02:52,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 160 transitions. [2024-11-09 06:02:52,565 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 160 transitions. Word has length 35 [2024-11-09 06:02:52,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:52,565 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 160 transitions. [2024-11-09 06:02:52,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 4.222222222222222) internal successors, (38), 11 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 06:02:52,565 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 160 transitions. [2024-11-09 06:02:52,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 06:02:52,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:52,566 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:02:52,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 06:02:52,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 06:02:52,768 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:02:52,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:52,768 INFO L85 PathProgramCache]: Analyzing trace with hash -23127193, now seen corresponding path program 1 times [2024-11-09 06:02:52,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:52,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283070745] [2024-11-09 06:02:52,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:52,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:02:54,132 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:02:54,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283070745] [2024-11-09 06:02:54,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283070745] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:02:54,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317026284] [2024-11-09 06:02:54,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:54,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:02:54,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:02:54,134 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:02:54,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 06:02:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:54,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 06:02:54,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:02:54,344 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 06:02:54,392 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 06:02:54,409 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-09 06:02:54,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:02:54,459 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 06:02:54,520 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 06:02:54,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:02:54,594 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 06:02:54,816 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 06:02:54,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:02:54,888 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 06:02:54,908 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 06:02:54,909 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:02:54,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317026284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:02:54,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:02:54,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2024-11-09 06:02:54,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208477346] [2024-11-09 06:02:54,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:02:54,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:02:54,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:02:54,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:02:54,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=224, Unknown=1, NotChecked=30, Total=306 [2024-11-09 06:02:54,911 INFO L87 Difference]: Start difference. First operand 138 states and 160 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:02:55,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:55,357 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2024-11-09 06:02:55,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:02:55,357 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-11-09 06:02:55,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:55,359 INFO L225 Difference]: With dead ends: 132 [2024-11-09 06:02:55,359 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 06:02:55,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=253, Unknown=1, NotChecked=32, Total=342 [2024-11-09 06:02:55,360 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 53 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:55,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 253 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 199 Invalid, 0 Unknown, 152 Unchecked, 0.4s Time] [2024-11-09 06:02:55,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 06:02:55,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2024-11-09 06:02:55,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 81 states have (on average 1.7654320987654322) internal successors, (143), 124 states have internal predecessors, (143), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 06:02:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2024-11-09 06:02:55,366 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 35 [2024-11-09 06:02:55,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:55,367 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2024-11-09 06:02:55,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:02:55,367 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2024-11-09 06:02:55,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 06:02:55,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:55,368 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 06:02:55,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 06:02:55,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 06:02:55,569 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:02:55,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:55,569 INFO L85 PathProgramCache]: Analyzing trace with hash -739322127, now seen corresponding path program 1 times [2024-11-09 06:02:55,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:55,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029822228] [2024-11-09 06:02:55,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:55,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:55,687 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 06:02:55,688 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:02:55,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029822228] [2024-11-09 06:02:55,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029822228] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:02:55,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866098997] [2024-11-09 06:02:55,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:55,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:02:55,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:02:55,691 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:02:55,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 06:02:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:55,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:02:55,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:02:55,954 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 06:02:55,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:02:55,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866098997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:02:55,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:02:55,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-09 06:02:55,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155443370] [2024-11-09 06:02:55,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:02:55,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:02:55,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:02:55,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:02:55,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:02:55,956 INFO L87 Difference]: Start difference. First operand 131 states and 153 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 06:02:56,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:56,042 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2024-11-09 06:02:56,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:02:56,043 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 06:02:56,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:56,043 INFO L225 Difference]: With dead ends: 110 [2024-11-09 06:02:56,044 INFO L226 Difference]: Without dead ends: 110 [2024-11-09 06:02:56,044 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 06:02:56,045 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:56,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:02:56,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-09 06:02:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-09 06:02:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 65 states have (on average 1.7538461538461538) internal successors, (114), 105 states have internal predecessors, (114), 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 06:02:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2024-11-09 06:02:56,049 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 36 [2024-11-09 06:02:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:56,049 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2024-11-09 06:02:56,049 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 06:02:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2024-11-09 06:02:56,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 06:02:56,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:56,050 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:02:56,069 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 06:02:56,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 06:02:56,254 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:02:56,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:56,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1781282336, now seen corresponding path program 1 times [2024-11-09 06:02:56,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:56,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004106915] [2024-11-09 06:02:56,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:56,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:57,447 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:02:57,447 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:02:57,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004106915] [2024-11-09 06:02:57,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004106915] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:02:57,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006680526] [2024-11-09 06:02:57,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:57,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:02:57,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:02:57,451 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:02:57,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 06:02:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:57,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 06:02:57,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:02:58,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-09 06:02:58,480 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_81| Int)) (and (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_81| (select |c_#valid| |v_node_create_~temp~0#1.base_81|))) (<= (+ |v_node_create_~temp~0#1.base_81| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_81|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_81| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_81|))))) is different from true [2024-11-09 06:02:58,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:02:58,505 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 06:02:58,545 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-09 06:02:58,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-11-09 06:02:58,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 06:02:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:02:58,631 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:02:58,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006680526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:02:58,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:02:58,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 22 [2024-11-09 06:02:58,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476926653] [2024-11-09 06:02:58,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:02:58,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 06:02:58,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:02:58,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 06:02:58,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=402, Unknown=1, NotChecked=40, Total=506 [2024-11-09 06:02:58,633 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 12 states, 9 states have (on average 3.0) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:02:59,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:59,612 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2024-11-09 06:02:59,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:02:59,613 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.0) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-11-09 06:02:59,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:59,614 INFO L225 Difference]: With dead ends: 152 [2024-11-09 06:02:59,614 INFO L226 Difference]: Without dead ends: 152 [2024-11-09 06:02:59,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=76, Invalid=479, Unknown=1, NotChecked=44, Total=600 [2024-11-09 06:02:59,615 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 83 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 194 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:59,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 441 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 486 Invalid, 0 Unknown, 194 Unchecked, 0.9s Time] [2024-11-09 06:02:59,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-09 06:02:59,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 118. [2024-11-09 06:02:59,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 73 states have (on average 1.821917808219178) internal successors, (133), 113 states have internal predecessors, (133), 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 06:02:59,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2024-11-09 06:02:59,621 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 38 [2024-11-09 06:02:59,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:59,621 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2024-11-09 06:02:59,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.0) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:02:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2024-11-09 06:02:59,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 06:02:59,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:59,623 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:02:59,641 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 06:02:59,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 06:02:59,824 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:02:59,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:59,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1781282335, now seen corresponding path program 1 times [2024-11-09 06:02:59,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:59,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867090683] [2024-11-09 06:02:59,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:59,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:03:02,203 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:03:02,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867090683] [2024-11-09 06:03:02,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867090683] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:03:02,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179005669] [2024-11-09 06:03:02,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:02,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:03:02,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:03:02,206 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:03:02,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 06:03:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:02,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-09 06:03:02,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:03:03,050 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 06:03:03,059 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 06:03:03,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:03:03,673 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 12 treesize of output 14 [2024-11-09 06:03:03,700 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:03:03,701 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 06:03:04,398 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 27 treesize of output 15 [2024-11-09 06:03:04,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:03:04,599 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_84| Int)) (and (= (store |c_old(#length)| |v_node_create_~temp~0#1.base_84| (select |c_#length| |v_node_create_~temp~0#1.base_84|)) |c_#length|) (= (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_84| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_84|)) |c_#memory_$Pointer$.base|) (<= (+ |v_node_create_~temp~0#1.base_84| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_84| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_84|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_84|) 0))) is different from true [2024-11-09 06:03:04,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:03:04,626 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 06:03:04,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:03:04,682 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 06:03:04,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2024-11-09 06:03:04,715 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 06:03:04,715 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 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 06:03:04,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:03:04,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:03:04,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 06:03:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 06:03:04,916 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:03:05,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179005669] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:03:05,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1697023487] [2024-11-09 06:03:05,588 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-09 06:03:05,588 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:03:05,588 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:03:05,589 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:03:05,589 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:03:06,901 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 06:03:06,932 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:03:25,436 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6057#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 0) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (= |ULTIMATE.start_dll_circular_insert_~index#1| 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 0) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (or (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 0) 4)) (< (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 0) 0)) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (<= 2 |ULTIMATE.start_dll_circular_insert_~head#1.base|) (= |ULTIMATE.start_dll_circular_insert_~data#1| 1) (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (or (and (exists ((|v_#valid_221| (Array Int Int))) (and (= (store |v_#valid_221| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 1) |#valid|) (= (select |v_#valid_221| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_250| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_250| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_250| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8))))) (exists ((|v_#memory_int_221| (Array Int (Array Int Int))) (|v_#memory_int_222| (Array Int (Array Int Int))) (|v_#memory_int_223| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_221| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_221| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_222| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_222|) (= (store |v_#memory_int_222| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_222| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_223| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4))) |v_#memory_int_223|) (= |#memory_int| (store |v_#memory_int_223| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_223| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8 1))))) (exists ((|v_#memory_$Pointer$.base_253| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_253| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_253| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8))) |#memory_$Pointer$.base|)) (exists ((|v_#length_193| (Array Int Int))) (= |#length| (store |v_#length_193| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 12))) (<= (+ |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_228| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_105| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#memory_int_BEFORE_CALL_91| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (Array Int (Array Int Int))) (|v_#memory_int_227| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_259| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_256| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (<= 8 (select |v_#length_BEFORE_CALL_105| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (store |v_#memory_int_227| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_227| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_228| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_228|) (<= 4 (select |v_#length_BEFORE_CALL_105| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= (store |v_#memory_int_228| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_228| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_#memory_int_BEFORE_CALL_91| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_#memory_int_BEFORE_CALL_91|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (store (store |v_#memory_$Pointer$.base_259| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_259| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_259| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_259| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select (select (store (store |v_#memory_$Pointer$.offset_256| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_256| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_256| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_256| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1)))) (and (exists ((|v_#valid_221| (Array Int Int))) (and (= (store |v_#valid_221| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 1) |#valid|) (= (select |v_#valid_221| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (exists ((|v_#memory_int_228| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_65| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_65| (Array Int Int)) (|v_#memory_int_BEFORE_CALL_93| (Array Int (Array Int Int))) (|v_#memory_int_227| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_259| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_256| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_107| (Array Int Int))) (and (= (select (select (store (store |v_#memory_$Pointer$.offset_256| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_256| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_256| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_256| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_#memory_int_228| (store |v_#memory_int_227| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_227| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_228| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0)))) (<= 8 (select |v_#length_BEFORE_CALL_107| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (<= 4 (select |v_#length_BEFORE_CALL_107| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= (select |v_old(#valid)_AFTER_CALL_65| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (store (store |v_#memory_$Pointer$.base_259| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_259| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_259| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_259| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_65|) (= (select |v_old(#valid)_AFTER_CALL_65| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= (store |v_#memory_int_228| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_228| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_#memory_int_BEFORE_CALL_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_#memory_int_BEFORE_CALL_93|))) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_250| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_250| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_250| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8))))) (exists ((|v_#memory_int_221| (Array Int (Array Int Int))) (|v_#memory_int_222| (Array Int (Array Int Int))) (|v_#memory_int_223| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_221| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_221| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_222| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_222|) (= (store |v_#memory_int_222| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_222| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_223| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4))) |v_#memory_int_223|) (= |#memory_int| (store |v_#memory_int_223| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_223| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8 1))))) (exists ((|v_#memory_$Pointer$.base_253| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_253| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_253| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8))) |#memory_$Pointer$.base|)) (exists ((|v_#length_193| (Array Int Int))) (= |#length| (store |v_#length_193| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 12))) (<= (+ |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))))' at error location [2024-11-09 06:03:25,436 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:03:25,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:03:25,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 29 [2024-11-09 06:03:25,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080709973] [2024-11-09 06:03:25,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:03:25,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 06:03:25,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:03:25,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 06:03:25,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2676, Unknown=3, NotChecked=104, Total=2970 [2024-11-09 06:03:25,439 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand has 30 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 25 states have internal predecessors, (57), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 06:03:30,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:30,128 INFO L93 Difference]: Finished difference Result 150 states and 164 transitions. [2024-11-09 06:03:30,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 06:03:30,129 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 25 states have internal predecessors, (57), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2024-11-09 06:03:30,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:30,131 INFO L225 Difference]: With dead ends: 150 [2024-11-09 06:03:30,131 INFO L226 Difference]: Without dead ends: 150 [2024-11-09 06:03:30,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=271, Invalid=3762, Unknown=3, NotChecked=124, Total=4160 [2024-11-09 06:03:30,133 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 479 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:30,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 697 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1475 Invalid, 0 Unknown, 163 Unchecked, 3.2s Time] [2024-11-09 06:03:30,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-09 06:03:30,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 118. [2024-11-09 06:03:30,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 73 states have (on average 1.7945205479452055) internal successors, (131), 113 states have internal predecessors, (131), 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 06:03:30,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2024-11-09 06:03:30,138 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 137 transitions. Word has length 38 [2024-11-09 06:03:30,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:30,138 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 137 transitions. [2024-11-09 06:03:30,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 25 states have internal predecessors, (57), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 06:03:30,138 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 137 transitions. [2024-11-09 06:03:30,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 06:03:30,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:30,139 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:03:30,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 06:03:30,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 06:03:30,340 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:03:30,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:30,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1781271445, now seen corresponding path program 1 times [2024-11-09 06:03:30,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:03:30,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047379085] [2024-11-09 06:03:30,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:30,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:03:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:30,442 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 06:03:30,442 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:03:30,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047379085] [2024-11-09 06:03:30,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047379085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:30,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:03:30,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:03:30,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101574568] [2024-11-09 06:03:30,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:30,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:03:30,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:03:30,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:03:30,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:03:30,445 INFO L87 Difference]: Start difference. First operand 118 states and 137 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 06:03:30,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:30,547 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2024-11-09 06:03:30,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:03:30,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2024-11-09 06:03:30,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:30,548 INFO L225 Difference]: With dead ends: 114 [2024-11-09 06:03:30,549 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 06:03:30,549 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 06:03:30,549 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 2 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:30,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 202 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:03:30,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 06:03:30,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-09 06:03:30,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 69 states have (on average 1.7391304347826086) internal successors, (120), 109 states have internal predecessors, (120), 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 06:03:30,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2024-11-09 06:03:30,554 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 38 [2024-11-09 06:03:30,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:30,554 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2024-11-09 06:03:30,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 06:03:30,555 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2024-11-09 06:03:30,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 06:03:30,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:30,555 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:03:30,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 06:03:30,556 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:03:30,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:30,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1890525708, now seen corresponding path program 1 times [2024-11-09 06:03:30,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:03:30,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362991884] [2024-11-09 06:03:30,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:30,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:03:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:30,744 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 06:03:30,744 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:03:30,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362991884] [2024-11-09 06:03:30,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362991884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:30,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:03:30,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:03:30,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173634911] [2024-11-09 06:03:30,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:30,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:03:30,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:03:30,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:03:30,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:03:30,746 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand has 6 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 06:03:31,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:31,263 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2024-11-09 06:03:31,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:03:31,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-11-09 06:03:31,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:31,265 INFO L225 Difference]: With dead ends: 108 [2024-11-09 06:03:31,265 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 06:03:31,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:03:31,266 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 30 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:31,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 274 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:03:31,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 06:03:31,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-09 06:03:31,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 69 states have (on average 1.6521739130434783) internal successors, (114), 103 states have internal predecessors, (114), 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 06:03:31,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2024-11-09 06:03:31,270 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 40 [2024-11-09 06:03:31,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:31,271 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2024-11-09 06:03:31,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 06:03:31,271 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2024-11-09 06:03:31,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 06:03:31,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:31,272 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:03:31,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 06:03:31,273 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:03:31,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:31,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1890525709, now seen corresponding path program 1 times [2024-11-09 06:03:31,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:03:31,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744375985] [2024-11-09 06:03:31,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:31,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:03:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:31,473 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 06:03:31,473 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:03:31,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744375985] [2024-11-09 06:03:31,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744375985] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:03:31,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931678974] [2024-11-09 06:03:31,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:31,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:03:31,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:03:31,476 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:03:31,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 06:03:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:31,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:03:31,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:03:31,828 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 06:03:31,828 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:03:31,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931678974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:31,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:03:31,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-09 06:03:31,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879650694] [2024-11-09 06:03:31,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:31,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:03:31,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:03:31,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:03:31,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:03:31,830 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:03:31,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:31,979 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2024-11-09 06:03:31,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:03:31,980 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-11-09 06:03:31,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:31,981 INFO L225 Difference]: With dead ends: 111 [2024-11-09 06:03:31,981 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 06:03:31,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:03:31,982 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 66 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:31,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 219 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:03:31,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 06:03:31,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2024-11-09 06:03:31,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 68 states have (on average 1.6176470588235294) internal successors, (110), 102 states have internal predecessors, (110), 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 06:03:31,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2024-11-09 06:03:31,987 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 40 [2024-11-09 06:03:31,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:31,988 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2024-11-09 06:03:31,988 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:03:31,988 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2024-11-09 06:03:31,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 06:03:31,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:31,989 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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 06:03:32,011 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 06:03:32,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:03:32,190 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:03:32,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:32,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1855270639, now seen corresponding path program 1 times [2024-11-09 06:03:32,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:03:32,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968334850] [2024-11-09 06:03:32,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:32,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:03:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:32,430 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 06:03:32,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:03:32,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968334850] [2024-11-09 06:03:32,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968334850] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:03:32,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555919946] [2024-11-09 06:03:32,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:32,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:03:32,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:03:32,433 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:03:32,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 06:03:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:32,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 06:03:32,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:03:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 06:03:32,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:03:32,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555919946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:32,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:03:32,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-11-09 06:03:32,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033760121] [2024-11-09 06:03:32,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:32,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:03:32,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:03:32,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:03:32,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:03:32,869 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:03:33,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:33,044 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2024-11-09 06:03:33,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:03:33,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-11-09 06:03:33,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:33,046 INFO L225 Difference]: With dead ends: 107 [2024-11-09 06:03:33,046 INFO L226 Difference]: Without dead ends: 107 [2024-11-09 06:03:33,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:03:33,047 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 59 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:33,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 217 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:03:33,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-09 06:03:33,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2024-11-09 06:03:33,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 98 states have internal predecessors, (105), 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 06:03:33,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2024-11-09 06:03:33,058 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 41 [2024-11-09 06:03:33,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:33,059 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2024-11-09 06:03:33,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:03:33,059 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2024-11-09 06:03:33,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 06:03:33,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:33,060 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:03:33,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 06:03:33,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:03:33,261 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:03:33,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:33,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1855259748, now seen corresponding path program 1 times [2024-11-09 06:03:33,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:03:33,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406692085] [2024-11-09 06:03:33,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:33,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:03:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 06:03:33,371 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:03:33,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406692085] [2024-11-09 06:03:33,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406692085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:33,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:03:33,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:03:33,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125835929] [2024-11-09 06:03:33,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:33,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:03:33,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:03:33,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:03:33,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:03:33,374 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 06:03:33,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:33,690 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2024-11-09 06:03:33,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:03:33,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2024-11-09 06:03:33,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:33,694 INFO L225 Difference]: With dead ends: 102 [2024-11-09 06:03:33,694 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 06:03:33,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:03:33,695 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:33,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 202 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:03:33,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 06:03:33,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-09 06:03:33,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.5757575757575757) internal successors, (104), 97 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:03:33,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2024-11-09 06:03:33,700 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 41 [2024-11-09 06:03:33,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:33,700 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2024-11-09 06:03:33,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 06:03:33,700 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2024-11-09 06:03:33,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 06:03:33,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:33,701 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:03:33,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 06:03:33,702 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:03:33,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:33,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1855259747, now seen corresponding path program 1 times [2024-11-09 06:03:33,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:03:33,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606641223] [2024-11-09 06:03:33,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:33,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:03:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:33,909 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 06:03:33,909 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:03:33,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606641223] [2024-11-09 06:03:33,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606641223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:33,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:03:33,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:03:33,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492404397] [2024-11-09 06:03:33,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:33,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:03:33,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:03:33,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:03:33,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:03:33,912 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 06:03:34,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:34,248 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2024-11-09 06:03:34,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:03:34,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2024-11-09 06:03:34,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:34,249 INFO L225 Difference]: With dead ends: 101 [2024-11-09 06:03:34,249 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 06:03:34,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:03:34,250 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 2 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:34,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 196 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:03:34,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 06:03:34,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-09 06:03:34,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 66 states have (on average 1.5606060606060606) internal successors, (103), 96 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:03:34,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2024-11-09 06:03:34,255 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 41 [2024-11-09 06:03:34,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:34,256 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2024-11-09 06:03:34,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 06:03:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2024-11-09 06:03:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 06:03:34,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:34,257 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:03:34,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 06:03:34,258 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:03:34,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:34,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1678477300, now seen corresponding path program 1 times [2024-11-09 06:03:34,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:03:34,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359556126] [2024-11-09 06:03:34,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:34,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:03:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 06:03:34,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:03:34,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359556126] [2024-11-09 06:03:34,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359556126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:03:34,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:03:34,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:03:34,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089078730] [2024-11-09 06:03:34,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:03:34,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:03:34,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:03:34,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:03:34,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:03:34,581 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 06:03:35,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:03:35,106 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2024-11-09 06:03:35,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:03:35,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2024-11-09 06:03:35,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:03:35,107 INFO L225 Difference]: With dead ends: 95 [2024-11-09 06:03:35,107 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 06:03:35,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:03:35,108 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 22 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:03:35,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 274 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:03:35,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 06:03:35,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-09 06:03:35,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 90 states have internal predecessors, (97), 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 06:03:35,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2024-11-09 06:03:35,112 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 42 [2024-11-09 06:03:35,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:03:35,113 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2024-11-09 06:03:35,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 06:03:35,113 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2024-11-09 06:03:35,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 06:03:35,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:03:35,114 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:03:35,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 06:03:35,115 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:03:35,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:03:35,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1891018382, now seen corresponding path program 1 times [2024-11-09 06:03:35,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:03:35,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837998851] [2024-11-09 06:03:35,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:35,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:03:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:03:38,230 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:03:38,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837998851] [2024-11-09 06:03:38,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837998851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:03:38,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180422860] [2024-11-09 06:03:38,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:03:38,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:03:38,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:03:38,235 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:03:38,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 06:03:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:03:39,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 107 conjuncts are in the unsatisfiable core [2024-11-09 06:03:39,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:03:39,268 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 06:03:39,828 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:03:39,828 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 06:03:40,141 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 06:03:40,383 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:03:40,384 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 06:03:40,785 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:03:40,786 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 06:03:41,013 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 57 treesize of output 36 [2024-11-09 06:03:41,210 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:03:41,210 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 25 [2024-11-09 06:03:41,222 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 7 treesize of output 3 [2024-11-09 06:03:41,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:03:41,750 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 06:03:41,750 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 66 treesize of output 45 [2024-11-09 06:03:41,853 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-11-09 06:03:41,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2024-11-09 06:03:41,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:03:41,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:03:42,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:03:42,558 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:03:42,558 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 36 [2024-11-09 06:03:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:03:43,025 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:03:43,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180422860] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:03:43,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [339537146] [2024-11-09 06:03:43,986 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2024-11-09 06:03:43,987 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:03:43,987 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:03:43,987 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:03:43,987 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:03:45,281 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 06:03:45,317 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:04:10,478 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8327#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (<= 2 |ULTIMATE.start_dll_circular_insert_~head#1.base|) (= |ULTIMATE.start_dll_circular_insert_~data#1| 1) (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (exists ((|v_#memory_$Pointer$.base_294| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_292| (Array Int (Array Int Int))) (|v_#memory_int_253| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_285| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_287| (Array Int (Array Int Int))) (|v_#memory_int_251| (Array Int (Array Int Int))) (|v_#memory_int_252| (Array Int (Array Int Int)))) (and (<= 0 (select (select |v_#memory_$Pointer$.offset_287| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4)) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_287| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_$Pointer$.offset_287| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0 |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (= (store (store |v_#memory_$Pointer$.base_292| (select (select |v_#memory_$Pointer$.base_294| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_292| (select (select |v_#memory_$Pointer$.base_294| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_287| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select (store |v_#memory_$Pointer$.base_292| (select (select |v_#memory_$Pointer$.base_294| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_292| (select (select |v_#memory_$Pointer$.base_294| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_287| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_$Pointer$.base_294| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4))) |v_#memory_$Pointer$.base_294|) (<= (+ (select (select |v_#memory_$Pointer$.offset_287| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) 4) (select |#length| (select (select |v_#memory_$Pointer$.base_294| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4))) (= |#memory_int| (store |v_#memory_int_253| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_253| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0)))) (= (store |v_#memory_$Pointer$.base_294| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_$Pointer$.base_294| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) |#memory_$Pointer$.base|) (= |v_#memory_$Pointer$.offset_287| (store (store |v_#memory_$Pointer$.offset_285| (select (select |v_#memory_$Pointer$.base_294| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_285| (select (select |v_#memory_$Pointer$.base_294| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_287| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) 0)) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_285| (select (select |v_#memory_$Pointer$.base_294| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_285| (select (select |v_#memory_$Pointer$.base_294| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_287| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) 0)) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_287| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4)))) (or (not (= (select (select |v_#memory_$Pointer$.offset_287| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) 0)) (not (= (select (select |v_#memory_$Pointer$.base_294| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) 0))) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_294| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4)) 1) (= (store |v_#memory_int_251| (select (select |v_#memory_$Pointer$.base_294| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) (store (select |v_#memory_int_251| (select (select |v_#memory_$Pointer$.base_294| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_287| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) (select (select |v_#memory_int_252| (select (select |v_#memory_$Pointer$.base_294| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_287| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4)))) |v_#memory_int_252|) (= |v_#memory_int_253| (store |v_#memory_int_252| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_252| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_253| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4)))))) (not (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0)))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))' at error location [2024-11-09 06:04:10,478 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:04:10,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:04:10,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 44 [2024-11-09 06:04:10,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627333727] [2024-11-09 06:04:10,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:04:10,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-09 06:04:10,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:04:10,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-09 06:04:10,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=5722, Unknown=4, NotChecked=0, Total=6006 [2024-11-09 06:04:10,481 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 45 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 38 states have internal predecessors, (72), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:04:17,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:04:17,247 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2024-11-09 06:04:17,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 06:04:17,247 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 38 states have internal predecessors, (72), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2024-11-09 06:04:17,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:04:17,248 INFO L225 Difference]: With dead ends: 96 [2024-11-09 06:04:17,248 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 06:04:17,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2787 ImplicationChecksByTransitivity, 32.6s TimeCoverageRelationStatistics Valid=461, Invalid=8277, Unknown=4, NotChecked=0, Total=8742 [2024-11-09 06:04:17,250 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 220 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 1850 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 1877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:04:17,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1171 Invalid, 1877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1850 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-09 06:04:17,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 06:04:17,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2024-11-09 06:04:17,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 89 states have internal predecessors, (96), 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 06:04:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2024-11-09 06:04:17,253 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 44 [2024-11-09 06:04:17,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:04:17,254 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2024-11-09 06:04:17,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 38 states have internal predecessors, (72), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:04:17,254 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2024-11-09 06:04:17,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 06:04:17,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:04:17,256 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:04:17,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-09 06:04:17,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:04:17,457 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:04:17,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:04:17,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1891018383, now seen corresponding path program 1 times [2024-11-09 06:04:17,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:04:17,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719638568] [2024-11-09 06:04:17,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:04:17,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:04:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:04:22,031 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:04:22,032 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:04:22,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719638568] [2024-11-09 06:04:22,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719638568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:04:22,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416968611] [2024-11-09 06:04:22,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:04:22,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:04:22,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:04:22,034 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:04:22,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 06:04:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:04:22,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 136 conjuncts are in the unsatisfiable core [2024-11-09 06:04:22,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:04:22,635 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 06:04:22,869 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 06:04:23,038 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 06:04:23,178 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 11 treesize of output 7 [2024-11-09 06:04:23,287 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 11 [2024-11-09 06:04:23,446 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 06:04:23,446 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 06:04:23,866 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 06:04:23,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:04:23,904 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 06:04:23,905 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 7 [2024-11-09 06:04:24,486 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 06:04:24,486 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 06:04:24,538 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 06:04:24,539 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 06:04:24,644 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2024-11-09 06:04:24,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 28 [2024-11-09 06:04:25,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 06:04:25,168 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:04:25,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:04:25,526 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 26 treesize of output 21 [2024-11-09 06:04:26,049 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 23 treesize of output 16 [2024-11-09 06:04:26,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:04:26,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 41 [2024-11-09 06:04:26,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-09 06:04:26,583 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:04:26,583 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 37 [2024-11-09 06:04:26,593 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 06:04:26,607 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 06:04:26,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2024-11-09 06:04:26,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:04:26,957 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 06:04:26,957 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 90 treesize of output 61 [2024-11-09 06:04:26,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:04:26,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:04:27,001 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 06:04:27,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 33 [2024-11-09 06:04:27,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:04:27,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:04:27,104 INFO L349 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2024-11-09 06:04:27,105 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 33 treesize of output 33 [2024-11-09 06:04:27,127 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-09 06:04:27,834 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:04:27,835 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 30 [2024-11-09 06:04:27,849 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 06:04:27,892 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:04:27,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:04:28,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416968611] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:04:28,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1123995313] [2024-11-09 06:04:28,896 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2024-11-09 06:04:28,896 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:04:28,897 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:04:28,897 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:04:28,897 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:04:30,417 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 06:04:30,443 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:05:00,292 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8794#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (<= 2 |ULTIMATE.start_dll_circular_insert_~head#1.base|) (= |ULTIMATE.start_dll_circular_insert_~data#1| 1) (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (or (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) 8)) (< (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) 4) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.offset_325| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_327| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_325| (Array Int (Array Int Int))) (|v_#memory_int_275| (Array Int (Array Int Int))) (|v_#memory_int_276| (Array Int (Array Int Int))) (|v_#memory_int_277| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_323| (Array Int (Array Int Int)))) (and (<= (+ 4 (select (select |v_#memory_$Pointer$.offset_325| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4)) (select |#length| (select (select |v_#memory_$Pointer$.base_327| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4))) (or (not (= (select (select |v_#memory_$Pointer$.offset_325| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) 0)) (not (= (select (select |v_#memory_$Pointer$.base_327| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) 0))) (= |v_#memory_int_277| (store |v_#memory_int_276| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_276| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_277| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4)))) (= (store |v_#memory_int_277| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_277| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) |#memory_int|) (<= 0 (select (select |v_#memory_$Pointer$.offset_325| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4)) (= |v_#memory_int_276| (store |v_#memory_int_275| (select (select |v_#memory_$Pointer$.base_327| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) (store (select |v_#memory_int_275| (select (select |v_#memory_$Pointer$.base_327| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_325| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) (select (select |v_#memory_int_276| (select (select |v_#memory_$Pointer$.base_327| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_325| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4))))) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_327| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4)) 1) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_325| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_$Pointer$.offset_325| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_327| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_$Pointer$.base_327| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0)))) (= (store (store |v_#memory_$Pointer$.offset_323| (select (select |v_#memory_$Pointer$.base_327| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_323| (select (select |v_#memory_$Pointer$.base_327| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_325| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) 0)) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_323| (select (select |v_#memory_$Pointer$.base_327| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_323| (select (select |v_#memory_$Pointer$.base_327| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_325| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) 0)) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_325| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4))) |v_#memory_$Pointer$.offset_325|) (= |v_#memory_$Pointer$.base_327| (store (store |v_#memory_$Pointer$.base_325| (select (select |v_#memory_$Pointer$.base_327| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_325| (select (select |v_#memory_$Pointer$.base_327| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_325| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select (store |v_#memory_$Pointer$.base_325| (select (select |v_#memory_$Pointer$.base_327| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_325| (select (select |v_#memory_$Pointer$.base_327| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_325| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_$Pointer$.base_327| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4)))))) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))' at error location [2024-11-09 06:05:00,292 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:05:00,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:05:00,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 47 [2024-11-09 06:05:00,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650018963] [2024-11-09 06:05:00,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:05:00,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-09 06:05:00,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:05:00,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-09 06:05:00,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=6033, Unknown=5, NotChecked=0, Total=6320 [2024-11-09 06:05:00,297 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand has 48 states, 37 states have (on average 1.7837837837837838) internal successors, (66), 38 states have internal predecessors, (66), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:05:07,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:05:07,030 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2024-11-09 06:05:07,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 06:05:07,030 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 37 states have (on average 1.7837837837837838) internal successors, (66), 38 states have internal predecessors, (66), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2024-11-09 06:05:07,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:05:07,031 INFO L225 Difference]: With dead ends: 94 [2024-11-09 06:05:07,031 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 06:05:07,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2877 ImplicationChecksByTransitivity, 38.1s TimeCoverageRelationStatistics Valid=425, Invalid=8312, Unknown=5, NotChecked=0, Total=8742 [2024-11-09 06:05:07,035 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 121 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 2011 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:05:07,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 989 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2011 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-09 06:05:07,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 06:05:07,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-11-09 06:05:07,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 88 states have internal predecessors, (95), 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 06:05:07,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2024-11-09 06:05:07,039 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 44 [2024-11-09 06:05:07,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:05:07,040 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2024-11-09 06:05:07,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 37 states have (on average 1.7837837837837838) internal successors, (66), 38 states have internal predecessors, (66), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:05:07,040 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2024-11-09 06:05:07,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 06:05:07,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:05:07,041 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:05:07,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-09 06:05:07,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 06:05:07,245 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:05:07,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:05:07,246 INFO L85 PathProgramCache]: Analyzing trace with hash 497502000, now seen corresponding path program 1 times [2024-11-09 06:05:07,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:05:07,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116676435] [2024-11-09 06:05:07,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:05:07,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:05:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:05:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 06:05:07,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:05:07,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116676435] [2024-11-09 06:05:07,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116676435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:05:07,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:05:07,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:05:07,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158240640] [2024-11-09 06:05:07,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:05:07,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:05:07,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:05:07,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:05:07,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:05:07,523 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 6 states, 4 states have (on average 7.5) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:05:07,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:05:07,813 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2024-11-09 06:05:07,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:05:07,814 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.5) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2024-11-09 06:05:07,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:05:07,815 INFO L225 Difference]: With dead ends: 91 [2024-11-09 06:05:07,815 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 06:05:07,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:05:07,816 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 65 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:05:07,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 221 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:05:07,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 06:05:07,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-11-09 06:05:07,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.393939393939394) internal successors, (92), 85 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:05:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2024-11-09 06:05:07,820 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 46 [2024-11-09 06:05:07,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:05:07,820 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2024-11-09 06:05:07,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.5) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:05:07,821 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2024-11-09 06:05:07,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 06:05:07,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:05:07,822 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:05:07,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 06:05:07,822 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:05:07,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:05:07,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1757303049, now seen corresponding path program 1 times [2024-11-09 06:05:07,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:05:07,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130306495] [2024-11-09 06:05:07,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:05:07,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:05:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:05:12,182 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:05:12,182 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:05:12,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130306495] [2024-11-09 06:05:12,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130306495] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:05:12,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82540836] [2024-11-09 06:05:12,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:05:12,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:05:12,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:05:12,184 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:05:12,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 06:05:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:05:12,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-09 06:05:12,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:05:12,697 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 06:05:13,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-09 06:05:14,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:05:14,088 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 06:05:14,120 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 06:05:14,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-09 06:05:14,594 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-09 06:05:14,594 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 29 treesize of output 32 [2024-11-09 06:05:14,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:05:14,898 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 06:05:14,898 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 37 [2024-11-09 06:05:14,953 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 06:05:15,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:05:15,111 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 06:05:15,192 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-11-09 06:05:15,193 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 29 treesize of output 23 [2024-11-09 06:05:15,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:05:15,512 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 65 treesize of output 51 [2024-11-09 06:05:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:05:15,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:05:17,120 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3257 (Array Int Int)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.offset| Int) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| Int)) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3257))) (store .cse0 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse0 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2024-11-09 06:05:20,009 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_27| Int) (v_ArrVal_3267 (Array Int Int)) (|ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| Int) (v_ArrVal_3257 (Array Int Int)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.offset| Int) (|ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_27| 1) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_27| v_ArrVal_3267) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_27|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_27| v_ArrVal_3257))) (store .cse0 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse0 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_27|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_27| 1)) (< |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0))) is different from false [2024-11-09 06:05:20,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82540836] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:05:20,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2048898534] [2024-11-09 06:05:20,014 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2024-11-09 06:05:20,014 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:05:20,015 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:05:20,015 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:05:20,015 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:05:21,581 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-09 06:05:21,610 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:05:55,409 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9463#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1)) (exists ((|v_#memory_$Pointer$.base_361| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_348| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| Int) (|v_#memory_int_302| (Array Int (Array Int Int))) (|v_#memory_int_301| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42| Int) (|v_#memory_$Pointer$.base_359| (Array Int (Array Int Int))) (|v_#memory_int_303| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_350| (Array Int (Array Int Int))) (|v_#memory_int_300| (Array Int (Array Int Int)))) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 1) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_361| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4)) 1) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_350| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4)) (store (select |v_#memory_$Pointer$.offset_350| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 0 |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38|)) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42| (store (select (store |v_#memory_$Pointer$.offset_350| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4)) (store (select |v_#memory_$Pointer$.offset_350| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 0 |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38|)) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4) 0))) (<= 0 (select (select |v_#memory_$Pointer$.offset_350| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4)) (= (store |v_#memory_int_300| (select (select |v_#memory_$Pointer$.base_361| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4) (store (select |v_#memory_int_300| (select (select |v_#memory_$Pointer$.base_361| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4)) (select (select |v_#memory_$Pointer$.offset_350| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4) (select (select |v_#memory_int_301| (select (select |v_#memory_$Pointer$.base_361| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4)) (select (select |v_#memory_$Pointer$.offset_350| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4)))) |v_#memory_int_301|) (= (store |v_#memory_int_302| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4)) (store (select |v_#memory_int_302| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 0 (select (select |v_#memory_int_303| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 0))) |v_#memory_int_303|) (= (store (store |v_#memory_$Pointer$.base_359| (select (select |v_#memory_$Pointer$.base_361| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4) (store (select |v_#memory_$Pointer$.base_359| (select (select |v_#memory_$Pointer$.base_361| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4)) (select (select |v_#memory_$Pointer$.offset_350| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4)))) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4)) (store (select (store |v_#memory_$Pointer$.base_359| (select (select |v_#memory_$Pointer$.base_361| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4) (store (select |v_#memory_$Pointer$.base_359| (select (select |v_#memory_$Pointer$.base_361| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4)) (select (select |v_#memory_$Pointer$.offset_350| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4)))) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4 (select (select |v_#memory_$Pointer$.base_361| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4))) |v_#memory_$Pointer$.base_361|) (or (not (= (select (select |v_#memory_$Pointer$.base_361| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4) 0)) (not (= (select (select |v_#memory_$Pointer$.offset_350| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4) 0))) (= (store |v_#memory_int_301| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4)) (store (select |v_#memory_int_301| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4 (select (select |v_#memory_int_302| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4))) |v_#memory_int_302|) (<= (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 8) (select |#length| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|)) (= (select |#valid| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) 1) (<= 0 (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4)) (= (store (store |v_#memory_$Pointer$.base_361| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4)) (store (select |v_#memory_$Pointer$.base_361| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 0 |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|)) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42| (store (select (store |v_#memory_$Pointer$.base_361| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4)) (store (select |v_#memory_$Pointer$.base_361| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 0 |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|)) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4)))) |#memory_$Pointer$.base|) (= (store (store |v_#memory_$Pointer$.offset_348| (select (select |v_#memory_$Pointer$.base_361| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4) (store (select |v_#memory_$Pointer$.offset_348| (select (select |v_#memory_$Pointer$.base_361| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4)) (select (select |v_#memory_$Pointer$.offset_350| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4) 0)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4)) (store (select (store |v_#memory_$Pointer$.offset_348| (select (select |v_#memory_$Pointer$.base_361| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4) (store (select |v_#memory_$Pointer$.offset_348| (select (select |v_#memory_$Pointer$.base_361| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4)) (select (select |v_#memory_$Pointer$.offset_350| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4) 0)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4 (select (select |v_#memory_$Pointer$.offset_350| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4))) |v_#memory_$Pointer$.offset_350|) (<= (+ 4 (select (select |v_#memory_$Pointer$.offset_350| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4)) (select |#length| (select (select |v_#memory_$Pointer$.base_361| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4))) 4))) (= (store |v_#memory_int_303| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42| (store (select |v_#memory_int_303| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4) (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.base_42|) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_38| 4)))) |#memory_int|))))' at error location [2024-11-09 06:05:55,410 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:05:55,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:05:55,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 18] total 47 [2024-11-09 06:05:55,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955135409] [2024-11-09 06:05:55,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:05:55,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-09 06:05:55,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:05:55,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-09 06:05:55,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=6531, Unknown=10, NotChecked=326, Total=7140 [2024-11-09 06:05:55,413 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 48 states, 39 states have (on average 2.076923076923077) internal successors, (81), 40 states have internal predecessors, (81), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 06:06:02,772 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 06:06:05,087 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 06:06:16,488 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 06:06:19,042 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 06:06:21,117 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 06:06:23,378 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 06:06:25,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:06:27,585 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 06:06:28,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:06:28,319 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2024-11-09 06:06:28,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-09 06:06:28,320 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 39 states have (on average 2.076923076923077) internal successors, (81), 40 states have internal predecessors, (81), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 47 [2024-11-09 06:06:28,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:06:28,321 INFO L225 Difference]: With dead ends: 95 [2024-11-09 06:06:28,321 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 06:06:28,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2894 ImplicationChecksByTransitivity, 55.0s TimeCoverageRelationStatistics Valid=541, Invalid=10795, Unknown=14, NotChecked=422, Total=11772 [2024-11-09 06:06:28,325 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 242 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 48 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:06:28,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1151 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1912 Invalid, 8 Unknown, 0 Unchecked, 20.1s Time] [2024-11-09 06:06:28,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 06:06:28,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2024-11-09 06:06:28,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 85 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 06:06:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2024-11-09 06:06:28,329 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 47 [2024-11-09 06:06:28,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:06:28,330 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2024-11-09 06:06:28,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 39 states have (on average 2.076923076923077) internal successors, (81), 40 states have internal predecessors, (81), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 06:06:28,331 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2024-11-09 06:06:28,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 06:06:28,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:06:28,332 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:06:28,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-09 06:06:28,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-09 06:06:28,533 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-09 06:06:28,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:06:28,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1757303048, now seen corresponding path program 1 times [2024-11-09 06:06:28,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:06:28,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097728183] [2024-11-09 06:06:28,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:06:28,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:06:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:06:33,721 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:06:33,721 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:06:33,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097728183] [2024-11-09 06:06:33,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097728183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:06:33,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235921958] [2024-11-09 06:06:33,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:06:33,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:06:33,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:06:33,723 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:06:33,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c914b4b-af0c-4bb0-8b7d-0bc6ec5a6c4e/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-09 06:06:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:06:34,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-11-09 06:06:34,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:06:34,062 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 06:06:34,079 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 06:06:34,247 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 06:06:34,252 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 06:06:34,361 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 06:06:34,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:06:34,413 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 06:06:34,432 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:06:34,432 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 06:06:34,588 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 06:06:35,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:06:35,104 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 06:06:36,022 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 28 treesize of output 16 [2024-11-09 06:06:36,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:06:36,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:06:36,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:06:36,051 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 06:06:36,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:06:36,784 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 06:06:36,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:06:36,803 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 36 treesize of output 27 [2024-11-09 06:06:36,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:06:36,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:06:36,864 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 06:06:36,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 29 [2024-11-09 06:06:36,911 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 06:06:36,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 15 treesize of output 15 [2024-11-09 06:06:37,679 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-09 06:06:37,680 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 38 treesize of output 33 [2024-11-09 06:06:37,717 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-09 06:06:37,717 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 19 treesize of output 18 [2024-11-09 06:06:38,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:06:38,270 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 06:06:38,270 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 89 [2024-11-09 06:06:38,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:06:38,342 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 06:06:38,343 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 100 [2024-11-09 06:06:38,569 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 06:06:38,802 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 06:06:38,846 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 06:06:39,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:06:39,285 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 69 treesize of output 58 [2024-11-09 06:06:39,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:06:39,363 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 06:06:39,563 INFO L349 Elim1Store]: treesize reduction 54, result has 40.7 percent of original size [2024-11-09 06:06:39,563 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 3 case distinctions, treesize of input 98 treesize of output 99 [2024-11-09 06:06:39,616 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-09 06:06:39,616 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 21 treesize of output 20 [2024-11-09 06:06:42,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:06:42,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 344 treesize of output 448 [2024-11-09 06:06:42,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:06:42,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 220 treesize of output 244 [2024-11-09 06:08:25,262 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-09 06:08:38,233 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-09 06:09:34,814 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-09 06:10:20,996 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-09 06:10:28,295 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-09 06:10:34,421 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-09 06:10:44,392 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts.