./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:49:16,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:49:16,339 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 15:49:16,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:49:16,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:49:16,389 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:49:16,390 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:49:16,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:49:16,392 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:49:16,392 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:49:16,392 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:49:16,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:49:16,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:49:16,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:49:16,393 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:49:16,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:49:16,394 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:49:16,395 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:49:16,395 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:49:16,396 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:49:16,396 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 15:49:16,396 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 15:49:16,396 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 15:49:16,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:49:16,396 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:49:16,397 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:49:16,397 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 15:49:16,397 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:49:16,397 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:49:16,397 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:49:16,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:49:16,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:49:16,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:49:16,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:49:16,398 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:49:16,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:49:16,398 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:49:16,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:49:16,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:49:16,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:49:16,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:49:16,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:49:16,398 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd 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 -> Automizer 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 -> 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc [2024-11-13 15:49:16,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:49:16,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:49:16,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:49:16,717 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:49:16,717 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:49:16,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/list-simple/dll2c_append_equal.i Unable to find full path for "g++" [2024-11-13 15:49:18,624 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:49:18,955 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:49:18,956 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/sv-benchmarks/c/list-simple/dll2c_append_equal.i [2024-11-13 15:49:18,968 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/data/d3e2e3a68/1db915f1106648889d262b21e97e5aae/FLAGd3b435f88 [2024-11-13 15:49:18,983 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/data/d3e2e3a68/1db915f1106648889d262b21e97e5aae [2024-11-13 15:49:18,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:49:18,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:49:18,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:49:18,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:49:18,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:49:18,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:49:18" (1/1) ... [2024-11-13 15:49:18,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27088a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:18, skipping insertion in model container [2024-11-13 15:49:18,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:49:18" (1/1) ... [2024-11-13 15:49:19,028 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:49:19,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:49:19,368 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:49:19,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:49:19,441 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:49:19,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:19 WrapperNode [2024-11-13 15:49:19,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:49:19,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:49:19,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:49:19,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:49:19,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:19" (1/1) ... [2024-11-13 15:49:19,464 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:19" (1/1) ... [2024-11-13 15:49:19,490 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 142 [2024-11-13 15:49:19,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:49:19,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:49:19,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:49:19,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:49:19,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:19" (1/1) ... [2024-11-13 15:49:19,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:19" (1/1) ... [2024-11-13 15:49:19,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:19" (1/1) ... [2024-11-13 15:49:19,546 INFO L175 MemorySlicer]: Split 29 memory accesses to 3 slices as follows [2, 9, 18]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 14 writes are split as follows [0, 1, 13]. [2024-11-13 15:49:19,546 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:19" (1/1) ... [2024-11-13 15:49:19,547 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:19" (1/1) ... [2024-11-13 15:49:19,561 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:19" (1/1) ... [2024-11-13 15:49:19,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:19" (1/1) ... [2024-11-13 15:49:19,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:19" (1/1) ... [2024-11-13 15:49:19,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:19" (1/1) ... [2024-11-13 15:49:19,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:49:19,584 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:49:19,585 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:49:19,585 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:49:19,586 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:19" (1/1) ... [2024-11-13 15:49:19,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:49:19,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:49:19,622 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:49:19,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:49:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 15:49:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 15:49:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 15:49:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 15:49:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 15:49:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 15:49:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-13 15:49:19,650 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-13 15:49:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 15:49:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:49:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 15:49:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 15:49:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 15:49:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 15:49:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 15:49:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 15:49:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 15:49:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 15:49:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 15:49:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 15:49:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 15:49:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:49:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 15:49:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 15:49:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:49:19,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:49:19,851 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:49:19,854 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:49:20,445 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2024-11-13 15:49:20,445 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:49:20,459 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:49:20,459 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-13 15:49:20,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:49:20 BoogieIcfgContainer [2024-11-13 15:49:20,460 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:49:20,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:49:20,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:49:20,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:49:20,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:49:18" (1/3) ... [2024-11-13 15:49:20,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4a769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:49:20, skipping insertion in model container [2024-11-13 15:49:20,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:19" (2/3) ... [2024-11-13 15:49:20,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4a769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:49:20, skipping insertion in model container [2024-11-13 15:49:20,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:49:20" (3/3) ... [2024-11-13 15:49:20,472 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_equal.i [2024-11-13 15:49:20,488 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:49:20,490 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_append_equal.i that has 2 procedures, 134 locations, 1 initial locations, 3 loop locations, and 60 error locations. [2024-11-13 15:49:20,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:49:20,553 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=PETRI_NET, 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;@b88e793, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:49:20,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2024-11-13 15:49:20,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 129 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-13 15:49:20,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 15:49:20,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:20,591 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 15:49:20,592 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:20,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:20,596 INFO L85 PathProgramCache]: Analyzing trace with hash 895487858, now seen corresponding path program 1 times [2024-11-13 15:49:20,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:20,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858933271] [2024-11-13 15:49:20,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:20,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:20,871 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-13 15:49:20,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:20,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858933271] [2024-11-13 15:49:20,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858933271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:20,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:20,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:49:20,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951617668] [2024-11-13 15:49:20,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:20,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:49:20,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:20,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:49:20,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:49:20,912 INFO L87 Difference]: Start difference. First operand has 134 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 129 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-13 15:49:21,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:21,124 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2024-11-13 15:49:21,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:49:21,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-11-13 15:49:21,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:21,136 INFO L225 Difference]: With dead ends: 130 [2024-11-13 15:49:21,136 INFO L226 Difference]: Without dead ends: 127 [2024-11-13 15:49:21,138 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-13 15:49:21,141 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 3 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:21,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 204 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:49:21,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-13 15:49:21,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-13 15:49:21,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 66 states have (on average 1.9545454545454546) internal successors, (129), 122 states have internal predecessors, (129), 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-13 15:49:21,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2024-11-13 15:49:21,196 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 6 [2024-11-13 15:49:21,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:21,196 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2024-11-13 15:49:21,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-13 15:49:21,197 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2024-11-13 15:49:21,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 15:49:21,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:21,198 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 15:49:21,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:49:21,199 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:21,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:21,200 INFO L85 PathProgramCache]: Analyzing trace with hash 895487859, now seen corresponding path program 1 times [2024-11-13 15:49:21,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:21,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638374258] [2024-11-13 15:49:21,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:21,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:21,382 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-13 15:49:21,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:21,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638374258] [2024-11-13 15:49:21,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638374258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:21,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:21,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:49:21,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139112727] [2024-11-13 15:49:21,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:21,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:49:21,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:21,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:49:21,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:49:21,385 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-13 15:49:21,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:21,539 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2024-11-13 15:49:21,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:49:21,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-11-13 15:49:21,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:21,543 INFO L225 Difference]: With dead ends: 124 [2024-11-13 15:49:21,543 INFO L226 Difference]: Without dead ends: 124 [2024-11-13 15:49:21,544 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-13 15:49:21,544 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 3 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:21,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 205 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:49:21,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-13 15:49:21,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-13 15:49:21,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 119 states have internal predecessors, (126), 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-13 15:49:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2024-11-13 15:49:21,561 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 6 [2024-11-13 15:49:21,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:21,561 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2024-11-13 15:49:21,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-13 15:49:21,562 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2024-11-13 15:49:21,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 15:49:21,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:21,564 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:21,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:49:21,565 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:21,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:21,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1023131430, now seen corresponding path program 1 times [2024-11-13 15:49:21,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:21,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126836527] [2024-11-13 15:49:21,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:21,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:21,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:49:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:21,778 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-13 15:49:21,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:21,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126836527] [2024-11-13 15:49:21,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126836527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:21,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:21,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:49:21,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266890666] [2024-11-13 15:49:21,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:21,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:49:21,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:21,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:49:21,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:49:21,780 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-13 15:49:21,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:21,973 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2024-11-13 15:49:21,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:49:21,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2024-11-13 15:49:21,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:21,975 INFO L225 Difference]: With dead ends: 135 [2024-11-13 15:49:21,975 INFO L226 Difference]: Without dead ends: 135 [2024-11-13 15:49:21,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-13 15:49:21,977 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 10 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:21,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 299 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:49:21,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-13 15:49:21,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2024-11-13 15:49:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 120 states have internal predecessors, (127), 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-13 15:49:21,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2024-11-13 15:49:21,987 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 14 [2024-11-13 15:49:21,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:21,987 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2024-11-13 15:49:21,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-13 15:49:21,988 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2024-11-13 15:49:21,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 15:49:21,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:21,990 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:21,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:49:21,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:21,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:21,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1097982879, now seen corresponding path program 1 times [2024-11-13 15:49:21,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:21,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811726075] [2024-11-13 15:49:21,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:21,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:22,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:49:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:22,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:49:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 15:49:22,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:22,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811726075] [2024-11-13 15:49:22,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811726075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:22,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:22,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:49:22,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718199350] [2024-11-13 15:49:22,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:22,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:49:22,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:22,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:49:22,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:49:22,360 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-13 15:49:22,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:22,728 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2024-11-13 15:49:22,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:49:22,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 24 [2024-11-13 15:49:22,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:22,729 INFO L225 Difference]: With dead ends: 124 [2024-11-13 15:49:22,729 INFO L226 Difference]: Without dead ends: 124 [2024-11-13 15:49:22,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:49:22,733 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 7 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:22,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 418 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:49:22,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-13 15:49:22,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-13 15:49:22,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 67 states have (on average 1.8805970149253732) internal successors, (126), 119 states have internal predecessors, (126), 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-13 15:49:22,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2024-11-13 15:49:22,741 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 24 [2024-11-13 15:49:22,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:22,741 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2024-11-13 15:49:22,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-13 15:49:22,742 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2024-11-13 15:49:22,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 15:49:22,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:22,742 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:22,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:49:22,743 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:22,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:22,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1097982878, now seen corresponding path program 1 times [2024-11-13 15:49:22,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:22,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41101126] [2024-11-13 15:49:22,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:22,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:22,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:49:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:22,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:49:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:49:23,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:23,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41101126] [2024-11-13 15:49:23,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41101126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:23,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:23,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:49:23,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129535928] [2024-11-13 15:49:23,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:23,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:49:23,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:23,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:49:23,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:49:23,131 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-13 15:49:23,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:23,480 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2024-11-13 15:49:23,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:49:23,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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 24 [2024-11-13 15:49:23,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:23,482 INFO L225 Difference]: With dead ends: 123 [2024-11-13 15:49:23,482 INFO L226 Difference]: Without dead ends: 123 [2024-11-13 15:49:23,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-13 15:49:23,485 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 6 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:23,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 442 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:49:23,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-13 15:49:23,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-13 15:49:23,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 67 states have (on average 1.8656716417910448) internal successors, (125), 118 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:49:23,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2024-11-13 15:49:23,498 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 24 [2024-11-13 15:49:23,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:23,498 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2024-11-13 15:49:23,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-13 15:49:23,498 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2024-11-13 15:49:23,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 15:49:23,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:23,499 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:23,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:49:23,500 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:23,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:23,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1400407778, now seen corresponding path program 1 times [2024-11-13 15:49:23,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:23,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176229816] [2024-11-13 15:49:23,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:23,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:23,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:49:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:23,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:49:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:49:23,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:23,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176229816] [2024-11-13 15:49:23,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176229816] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:23,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004769589] [2024-11-13 15:49:23,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:23,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:23,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:49:23,921 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:49:23,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:49:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:24,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 15:49:24,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:49:24,123 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-13 15:49:24,186 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-13 15:49:24,245 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 15:49:24,245 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-13 15:49:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-13 15:49:24,267 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:49:24,543 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:49:24,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004769589] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:49:24,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:49:24,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2024-11-13 15:49:24,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706434741] [2024-11-13 15:49:24,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:49:24,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 15:49:24,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:24,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 15:49:24,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-11-13 15:49:24,546 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 15:49:25,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:25,084 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2024-11-13 15:49:25,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:49:25,085 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2024-11-13 15:49:25,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:25,087 INFO L225 Difference]: With dead ends: 128 [2024-11-13 15:49:25,087 INFO L226 Difference]: Without dead ends: 128 [2024-11-13 15:49:25,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2024-11-13 15:49:25,088 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:25,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 538 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 474 Invalid, 0 Unknown, 132 Unchecked, 0.4s Time] [2024-11-13 15:49:25,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-13 15:49:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-13 15:49:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 71 states have (on average 1.8450704225352113) internal successors, (131), 122 states have internal predecessors, (131), 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-13 15:49:25,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2024-11-13 15:49:25,096 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 26 [2024-11-13 15:49:25,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:25,096 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2024-11-13 15:49:25,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 15:49:25,096 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2024-11-13 15:49:25,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 15:49:25,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:25,097 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:25,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 15:49:25,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:25,301 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:25,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:25,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1400407779, now seen corresponding path program 1 times [2024-11-13 15:49:25,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:25,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260618265] [2024-11-13 15:49:25,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:25,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:25,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:49:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:25,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:49:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:25,933 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:49:25,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:25,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260618265] [2024-11-13 15:49:25,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260618265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:25,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61291602] [2024-11-13 15:49:25,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:25,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:25,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:49:25,936 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:49:25,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:49:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:26,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 15:49:26,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:49:26,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 15:49:26,393 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 15:49:26,394 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-13 15:49:26,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:49:26,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:49:26,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61291602] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:26,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:49:26,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2024-11-13 15:49:26,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944143040] [2024-11-13 15:49:26,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:49:26,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 15:49:26,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:26,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 15:49:26,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2024-11-13 15:49:26,681 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 13 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:49:27,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:27,536 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2024-11-13 15:49:27,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:49:27,537 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 13 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2024-11-13 15:49:27,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:27,538 INFO L225 Difference]: With dead ends: 128 [2024-11-13 15:49:27,538 INFO L226 Difference]: Without dead ends: 128 [2024-11-13 15:49:27,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2024-11-13 15:49:27,540 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:27,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 838 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 15:49:27,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-13 15:49:27,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-13 15:49:27,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 71 states have (on average 1.8309859154929577) internal successors, (130), 122 states have internal predecessors, (130), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 15:49:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2024-11-13 15:49:27,557 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 26 [2024-11-13 15:49:27,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:27,557 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2024-11-13 15:49:27,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 13 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:49:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2024-11-13 15:49:27,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 15:49:27,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:27,559 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:27,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 15:49:27,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:27,760 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:27,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:27,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1467265112, now seen corresponding path program 1 times [2024-11-13 15:49:27,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:27,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768904195] [2024-11-13 15:49:27,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:27,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:27,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:49:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:27,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:49:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:49:27,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:27,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768904195] [2024-11-13 15:49:27,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768904195] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:27,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462248672] [2024-11-13 15:49:27,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:27,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:27,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:49:27,927 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:49:27,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 15:49:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:28,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 15:49:28,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:49:28,131 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:49:28,132 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:49:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:49:28,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462248672] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:49:28,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:49:28,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-11-13 15:49:28,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022421401] [2024-11-13 15:49:28,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:49:28,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:49:28,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:28,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:49:28,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:49:28,191 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 15:49:28,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:28,390 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2024-11-13 15:49:28,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:49:28,391 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-13 15:49:28,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:28,391 INFO L225 Difference]: With dead ends: 128 [2024-11-13 15:49:28,392 INFO L226 Difference]: Without dead ends: 128 [2024-11-13 15:49:28,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:49:28,393 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 1 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:28,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 629 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:49:28,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-13 15:49:28,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-13 15:49:28,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 71 states have (on average 1.8169014084507042) internal successors, (129), 122 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 15:49:28,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2024-11-13 15:49:28,406 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 28 [2024-11-13 15:49:28,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:28,406 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2024-11-13 15:49:28,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 15:49:28,406 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2024-11-13 15:49:28,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 15:49:28,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:28,407 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:28,433 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 15:49:28,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-13 15:49:28,611 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:28,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:28,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1764202448, now seen corresponding path program 1 times [2024-11-13 15:49:28,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:28,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882854823] [2024-11-13 15:49:28,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:28,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:28,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:49:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:28,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:49:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:28,768 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 15:49:28,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:28,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882854823] [2024-11-13 15:49:28,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882854823] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:28,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208242216] [2024-11-13 15:49:28,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:28,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:28,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:49:28,772 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:49:28,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 15:49:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:28,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 15:49:28,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:49:28,960 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-13 15:49:29,039 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-13 15:49:29,119 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 15:49:29,119 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-13 15:49:29,135 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2024-11-13 15:49:29,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:49:29,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208242216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:29,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:49:29,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2024-11-13 15:49:29,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124697779] [2024-11-13 15:49:29,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:49:29,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:49:29,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:29,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:49:29,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=89, Unknown=1, NotChecked=18, Total=132 [2024-11-13 15:49:29,223 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:49:29,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:29,713 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2024-11-13 15:49:29,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:49:29,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2024-11-13 15:49:29,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:29,715 INFO L225 Difference]: With dead ends: 127 [2024-11-13 15:49:29,715 INFO L226 Difference]: Without dead ends: 127 [2024-11-13 15:49:29,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=149, Unknown=1, NotChecked=24, Total=210 [2024-11-13 15:49:29,716 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 9 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:29,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 520 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 482 Invalid, 0 Unknown, 129 Unchecked, 0.4s Time] [2024-11-13 15:49:29,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-13 15:49:29,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-13 15:49:29,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.8028169014084507) internal successors, (128), 121 states have internal predecessors, (128), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 15:49:29,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2024-11-13 15:49:29,726 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 29 [2024-11-13 15:49:29,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:29,727 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2024-11-13 15:49:29,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:49:29,727 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2024-11-13 15:49:29,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 15:49:29,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:29,728 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:29,752 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 15:49:29,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-13 15:49:29,929 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:29,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:29,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1764202447, now seen corresponding path program 1 times [2024-11-13 15:49:29,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:29,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335869282] [2024-11-13 15:49:29,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:29,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:49:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:49:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,234 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:49:30,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:30,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335869282] [2024-11-13 15:49:30,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335869282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:30,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770550334] [2024-11-13 15:49:30,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:30,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:30,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:49:30,237 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:49:30,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 15:49:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 15:49:30,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:49:30,451 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-13 15:49:30,457 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-13 15:49:30,656 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-13 15:49:30,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:49:30,721 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-13 15:49:30,735 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:49:30,736 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-13 15:49:30,791 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-13 15:49:30,791 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:49:30,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770550334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:30,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:49:30,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-13 15:49:30,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101264900] [2024-11-13 15:49:30,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:49:30,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 15:49:30,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:30,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 15:49:30,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=230, Unknown=1, NotChecked=30, Total=306 [2024-11-13 15:49:30,960 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:49:31,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:31,691 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2024-11-13 15:49:31,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:49:31,691 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2024-11-13 15:49:31,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:31,694 INFO L225 Difference]: With dead ends: 144 [2024-11-13 15:49:31,694 INFO L226 Difference]: Without dead ends: 144 [2024-11-13 15:49:31,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=353, Unknown=1, NotChecked=38, Total=462 [2024-11-13 15:49:31,695 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 16 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:31,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 896 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 631 Invalid, 0 Unknown, 151 Unchecked, 0.6s Time] [2024-11-13 15:49:31,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-13 15:49:31,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 137. [2024-11-13 15:49:31,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 80 states have (on average 1.775) internal successors, (142), 130 states have internal predecessors, (142), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 15:49:31,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2024-11-13 15:49:31,701 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 29 [2024-11-13 15:49:31,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:31,702 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2024-11-13 15:49:31,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-13 15:49:31,702 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2024-11-13 15:49:31,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 15:49:31,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:31,703 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:31,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 15:49:31,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-13 15:49:31,907 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:31,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:31,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1144298964, now seen corresponding path program 1 times [2024-11-13 15:49:31,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:31,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621631814] [2024-11-13 15:49:31,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:31,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:32,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:49:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:32,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:49:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:32,134 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 15:49:32,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:32,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621631814] [2024-11-13 15:49:32,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621631814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:32,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:32,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:49:32,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915953626] [2024-11-13 15:49:32,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:32,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:49:32,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:32,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:49:32,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:49:32,136 INFO L87 Difference]: Start difference. First operand 137 states and 152 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:49:32,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:32,524 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2024-11-13 15:49:32,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:49:32,525 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-13 15:49:32,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:32,526 INFO L225 Difference]: With dead ends: 136 [2024-11-13 15:49:32,526 INFO L226 Difference]: Without dead ends: 136 [2024-11-13 15:49:32,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:49:32,527 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 7 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:32,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 468 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:49:32,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-13 15:49:32,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-13 15:49:32,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 80 states have (on average 1.7625) internal successors, (141), 129 states have internal predecessors, (141), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 15:49:32,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 151 transitions. [2024-11-13 15:49:32,533 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 151 transitions. Word has length 30 [2024-11-13 15:49:32,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:32,533 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 151 transitions. [2024-11-13 15:49:32,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:49:32,534 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2024-11-13 15:49:32,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 15:49:32,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:32,534 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:32,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 15:49:32,535 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:32,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:32,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1144298965, now seen corresponding path program 1 times [2024-11-13 15:49:32,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:32,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373050145] [2024-11-13 15:49:32,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:32,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:32,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:49:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:32,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:49:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:49:32,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:32,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373050145] [2024-11-13 15:49:32,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373050145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:32,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:32,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:49:32,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776185329] [2024-11-13 15:49:32,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:32,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:49:32,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:32,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:49:32,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:49:32,857 INFO L87 Difference]: Start difference. First operand 136 states and 151 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:49:33,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:33,252 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2024-11-13 15:49:33,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:49:33,252 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-13 15:49:33,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:33,253 INFO L225 Difference]: With dead ends: 135 [2024-11-13 15:49:33,254 INFO L226 Difference]: Without dead ends: 135 [2024-11-13 15:49:33,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:49:33,254 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 6 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:33,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 493 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:49:33,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-13 15:49:33,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-13 15:49:33,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 80 states have (on average 1.75) internal successors, (140), 128 states have internal predecessors, (140), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 15:49:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2024-11-13 15:49:33,260 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 30 [2024-11-13 15:49:33,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:33,260 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2024-11-13 15:49:33,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:49:33,260 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2024-11-13 15:49:33,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-13 15:49:33,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:33,263 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:33,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 15:49:33,263 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:33,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:33,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1816268564, now seen corresponding path program 1 times [2024-11-13 15:49:33,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:33,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684392833] [2024-11-13 15:49:33,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:33,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:33,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:49:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:33,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:49:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:33,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 15:49:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:33,450 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 15:49:33,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:33,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684392833] [2024-11-13 15:49:33,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684392833] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:33,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811184089] [2024-11-13 15:49:33,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:33,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:33,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:49:33,453 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:49:33,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 15:49:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:33,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 15:49:33,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:49:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 15:49:33,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:49:33,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811184089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:33,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:49:33,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-13 15:49:33,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425612256] [2024-11-13 15:49:33,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:33,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:49:33,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:33,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:49:33,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:49:33,759 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-13 15:49:33,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:33,782 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2024-11-13 15:49:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:49:33,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 41 [2024-11-13 15:49:33,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:33,784 INFO L225 Difference]: With dead ends: 117 [2024-11-13 15:49:33,785 INFO L226 Difference]: Without dead ends: 117 [2024-11-13 15:49:33,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:49:33,787 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:33,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:49:33,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-13 15:49:33,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-13 15:49:33,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 67 states have (on average 1.7462686567164178) internal successors, (117), 112 states have internal predecessors, (117), 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-13 15:49:33,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2024-11-13 15:49:33,794 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 41 [2024-11-13 15:49:33,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:33,794 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2024-11-13 15:49:33,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-13 15:49:33,794 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2024-11-13 15:49:33,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 15:49:33,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:33,797 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:33,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 15:49:33,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-13 15:49:33,998 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:33,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:33,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1052698028, now seen corresponding path program 1 times [2024-11-13 15:49:33,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:33,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286744772] [2024-11-13 15:49:33,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:33,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:49:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:49:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:49:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 15:49:34,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:34,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286744772] [2024-11-13 15:49:34,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286744772] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:34,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089512186] [2024-11-13 15:49:34,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:34,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:34,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:49:34,676 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:49:34,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 15:49:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 15:49:34,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:49:34,959 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-13 15:49:34,972 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-13 15:49:35,062 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 15:49:35,063 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-13 15:49:35,159 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 9 treesize of output 7 [2024-11-13 15:49:35,181 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-13 15:49:35,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:49:35,251 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 18 treesize of output 13 [2024-11-13 15:49:35,349 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-13 15:49:35,388 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 15:49:35,389 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-13 15:49:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 21 not checked. [2024-11-13 15:49:35,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:49:35,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089512186] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:35,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:49:35,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2024-11-13 15:49:35,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952899909] [2024-11-13 15:49:35,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:49:35,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 15:49:35,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:35,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 15:49:35,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=279, Unknown=2, NotChecked=70, Total=420 [2024-11-13 15:49:35,753 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-13 15:49:36,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:36,433 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2024-11-13 15:49:36,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:49:36,434 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2024-11-13 15:49:36,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:36,435 INFO L225 Difference]: With dead ends: 127 [2024-11-13 15:49:36,435 INFO L226 Difference]: Without dead ends: 127 [2024-11-13 15:49:36,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=375, Unknown=2, NotChecked=82, Total=552 [2024-11-13 15:49:36,437 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 462 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:36,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 351 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 463 Invalid, 0 Unknown, 254 Unchecked, 0.5s Time] [2024-11-13 15:49:36,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-13 15:49:36,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2024-11-13 15:49:36,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 67 states have (on average 1.626865671641791) internal successors, (109), 104 states have internal predecessors, (109), 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-13 15:49:36,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2024-11-13 15:49:36,443 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 43 [2024-11-13 15:49:36,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:36,444 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2024-11-13 15:49:36,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-13 15:49:36,444 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2024-11-13 15:49:36,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 15:49:36,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:36,446 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:36,469 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 15:49:36,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:36,647 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:36,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:36,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1052698029, now seen corresponding path program 1 times [2024-11-13 15:49:36,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:36,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886146466] [2024-11-13 15:49:36,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:36,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:37,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:49:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:37,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:49:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:37,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:49:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 15:49:37,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:37,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886146466] [2024-11-13 15:49:37,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886146466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:37,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982341006] [2024-11-13 15:49:37,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:37,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:37,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:49:37,658 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:49:37,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 15:49:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:37,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-13 15:49:37,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:49:37,929 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-13 15:49:37,961 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-13 15:49:37,990 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-13 15:49:38,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:49:38,050 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-13 15:49:38,077 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-13 15:49:38,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:49:38,150 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-13 15:49:38,277 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-13 15:49:38,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:49:38,330 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-13 15:49:38,340 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 15:49:38,340 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:49:38,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982341006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:38,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:49:38,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2024-11-13 15:49:38,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302415500] [2024-11-13 15:49:38,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:38,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:49:38,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:38,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:49:38,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=169, Unknown=1, NotChecked=26, Total=240 [2024-11-13 15:49:38,341 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-13 15:49:38,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:38,560 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2024-11-13 15:49:38,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:49:38,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 43 [2024-11-13 15:49:38,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:38,562 INFO L225 Difference]: With dead ends: 104 [2024-11-13 15:49:38,562 INFO L226 Difference]: Without dead ends: 104 [2024-11-13 15:49:38,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=193, Unknown=1, NotChecked=28, Total=272 [2024-11-13 15:49:38,563 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 26 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:38,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 280 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 184 Invalid, 0 Unknown, 142 Unchecked, 0.2s Time] [2024-11-13 15:49:38,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-13 15:49:38,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-13 15:49:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 99 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-13 15:49:38,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2024-11-13 15:49:38,567 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 43 [2024-11-13 15:49:38,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:38,567 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2024-11-13 15:49:38,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-13 15:49:38,568 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2024-11-13 15:49:38,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 15:49:38,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:38,568 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:38,590 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 15:49:38,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-13 15:49:38,769 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:38,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1969476403, now seen corresponding path program 1 times [2024-11-13 15:49:38,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:38,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139589349] [2024-11-13 15:49:38,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:38,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:38,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:49:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:38,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:49:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:38,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:49:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:38,965 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 15:49:38,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:38,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139589349] [2024-11-13 15:49:38,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139589349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:38,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:38,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:49:38,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049677841] [2024-11-13 15:49:38,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:38,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:49:38,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:38,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:49:38,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:49:38,967 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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-13 15:49:39,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:39,206 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2024-11-13 15:49:39,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:49:39,207 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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 45 [2024-11-13 15:49:39,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:39,207 INFO L225 Difference]: With dead ends: 100 [2024-11-13 15:49:39,208 INFO L226 Difference]: Without dead ends: 100 [2024-11-13 15:49:39,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:49:39,208 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 19 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:39,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 325 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:49:39,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-13 15:49:39,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-13 15:49:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 67 states have (on average 1.492537313432836) internal successors, (100), 95 states have internal predecessors, (100), 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-13 15:49:39,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2024-11-13 15:49:39,215 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 45 [2024-11-13 15:49:39,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:39,215 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2024-11-13 15:49:39,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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-13 15:49:39,216 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2024-11-13 15:49:39,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 15:49:39,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:39,216 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:39,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 15:49:39,216 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:39,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:39,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1969476402, now seen corresponding path program 1 times [2024-11-13 15:49:39,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:39,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133115491] [2024-11-13 15:49:39,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:39,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:39,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:49:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:39,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:49:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:39,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:49:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:39,529 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 15:49:39,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:39,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133115491] [2024-11-13 15:49:39,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133115491] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:39,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137858775] [2024-11-13 15:49:39,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:39,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:39,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:49:39,532 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:49:39,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 15:49:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:39,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 15:49:39,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:49:39,946 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 15:49:39,946 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:49:39,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137858775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:39,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:49:39,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2024-11-13 15:49:39,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151759371] [2024-11-13 15:49:39,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:39,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:49:39,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:39,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:49:39,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2024-11-13 15:49:39,948 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-13 15:49:40,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:40,140 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2024-11-13 15:49:40,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:49:40,141 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 45 [2024-11-13 15:49:40,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:40,142 INFO L225 Difference]: With dead ends: 96 [2024-11-13 15:49:40,144 INFO L226 Difference]: Without dead ends: 96 [2024-11-13 15:49:40,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2024-11-13 15:49:40,145 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 21 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:40,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 377 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:49:40,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-13 15:49:40,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-13 15:49:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 91 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-13 15:49:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2024-11-13 15:49:40,149 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 45 [2024-11-13 15:49:40,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:40,149 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2024-11-13 15:49:40,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-13 15:49:40,150 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2024-11-13 15:49:40,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-13 15:49:40,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:40,151 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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-13 15:49:40,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 15:49:40,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 15:49:40,355 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:40,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:40,356 INFO L85 PathProgramCache]: Analyzing trace with hash -924215404, now seen corresponding path program 1 times [2024-11-13 15:49:40,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:40,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728452452] [2024-11-13 15:49:40,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:40,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:40,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:49:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:40,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:49:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:41,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:49:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:41,130 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 15:49:41,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:41,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728452452] [2024-11-13 15:49:41,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728452452] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:41,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9561269] [2024-11-13 15:49:41,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:41,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:41,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:49:41,133 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:49:41,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 15:49:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:41,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-13 15:49:41,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:49:41,786 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-13 15:49:42,059 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 9 treesize of output 3 [2024-11-13 15:49:42,106 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| 12) |c_#length|))) is different from true [2024-11-13 15:49:42,165 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-13 15:49:42,166 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 16 treesize of output 18 [2024-11-13 15:49:42,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 17 treesize of output 9 [2024-11-13 15:49:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2024-11-13 15:49:42,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:49:42,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9561269] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:42,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:49:42,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2024-11-13 15:49:42,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585726395] [2024-11-13 15:49:42,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:49:42,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-13 15:49:42,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:42,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-13 15:49:42,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=583, Unknown=1, NotChecked=48, Total=702 [2024-11-13 15:49:42,429 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 24 states, 22 states have (on average 3.227272727272727) internal successors, (71), 20 states have internal predecessors, (71), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-13 15:49:43,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:43,543 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2024-11-13 15:49:43,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 15:49:43,544 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.227272727272727) internal successors, (71), 20 states have internal predecessors, (71), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2024-11-13 15:49:43,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:43,545 INFO L225 Difference]: With dead ends: 103 [2024-11-13 15:49:43,545 INFO L226 Difference]: Without dead ends: 103 [2024-11-13 15:49:43,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=1264, Unknown=1, NotChecked=72, Total=1482 [2024-11-13 15:49:43,546 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 73 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:43,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 813 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 927 Invalid, 0 Unknown, 101 Unchecked, 0.7s Time] [2024-11-13 15:49:43,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-13 15:49:43,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-13 15:49:43,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 97 states have internal predecessors, (102), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:49:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2024-11-13 15:49:43,553 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 46 [2024-11-13 15:49:43,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:43,553 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2024-11-13 15:49:43,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.227272727272727) internal successors, (71), 20 states have internal predecessors, (71), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-13 15:49:43,553 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2024-11-13 15:49:43,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-13 15:49:43,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:43,553 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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-13 15:49:43,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-13 15:49:43,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 15:49:43,761 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:43,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:43,762 INFO L85 PathProgramCache]: Analyzing trace with hash -924215405, now seen corresponding path program 1 times [2024-11-13 15:49:43,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:43,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730350533] [2024-11-13 15:49:43,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:43,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:44,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:49:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:44,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:49:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:44,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:49:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:44,236 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 15:49:44,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:44,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730350533] [2024-11-13 15:49:44,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730350533] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:44,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801044827] [2024-11-13 15:49:44,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:44,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:44,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:49:44,238 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:49:44,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 15:49:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:44,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-13 15:49:45,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:49:45,257 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 9 treesize of output 3 [2024-11-13 15:49:45,283 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-13 15:49:45,312 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-13 15:49:45,312 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 16 treesize of output 18 [2024-11-13 15:49:45,363 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-13 15:49:45,366 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2024-11-13 15:49:45,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:49:45,526 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 18 treesize of output 10 [2024-11-13 15:49:45,560 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 15:49:45,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801044827] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:45,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:49:45,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12, 13] total 24 [2024-11-13 15:49:45,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422656621] [2024-11-13 15:49:45,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:45,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:49:45,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:45,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:49:45,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=490, Unknown=1, NotChecked=44, Total=600 [2024-11-13 15:49:45,561 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 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-13 15:49:45,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:45,838 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2024-11-13 15:49:45,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:49:45,839 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 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 46 [2024-11-13 15:49:45,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:45,840 INFO L225 Difference]: With dead ends: 102 [2024-11-13 15:49:45,840 INFO L226 Difference]: Without dead ends: 102 [2024-11-13 15:49:45,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=534, Unknown=1, NotChecked=46, Total=650 [2024-11-13 15:49:45,841 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 13 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:45,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 370 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:49:45,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-13 15:49:45,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-13 15:49:45,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.364864864864865) internal successors, (101), 96 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:49:45,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2024-11-13 15:49:45,847 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 46 [2024-11-13 15:49:45,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:45,848 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2024-11-13 15:49:45,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 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-13 15:49:45,848 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2024-11-13 15:49:45,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-13 15:49:45,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:45,848 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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-13 15:49:45,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 15:49:46,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:46,053 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:46,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:46,054 INFO L85 PathProgramCache]: Analyzing trace with hash 887227188, now seen corresponding path program 1 times [2024-11-13 15:49:46,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:46,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002581368] [2024-11-13 15:49:46,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:46,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:46,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:49:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:46,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:49:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:46,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:49:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:47,302 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 15:49:47,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:47,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002581368] [2024-11-13 15:49:47,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002581368] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:47,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398488632] [2024-11-13 15:49:47,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:47,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:47,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:49:47,305 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:49:47,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 15:49:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:47,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-13 15:49:47,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:49:47,819 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 19 treesize of output 1 [2024-11-13 15:49:47,948 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 19 treesize of output 5 [2024-11-13 15:49:47,953 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-13 15:49:47,953 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 7 [2024-11-13 15:49:48,034 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= |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-13 15:49:48,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:49:48,061 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 28 treesize of output 23 [2024-11-13 15:49:48,127 INFO L349 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2024-11-13 15:49:48,128 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 42 treesize of output 64 [2024-11-13 15:49:48,167 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 36 treesize of output 24 [2024-11-13 15:49:48,171 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 23 treesize of output 15 [2024-11-13 15:49:48,217 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 21 treesize of output 9 [2024-11-13 15:49:48,241 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 15:49:48,242 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:49:48,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398488632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:48,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:49:48,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [20] total 30 [2024-11-13 15:49:48,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124241343] [2024-11-13 15:49:48,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:48,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 15:49:48,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:48,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 15:49:48,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=797, Unknown=1, NotChecked=56, Total=930 [2024-11-13 15:49:48,244 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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-13 15:49:48,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:48,705 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2024-11-13 15:49:48,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 15:49:48,706 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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 48 [2024-11-13 15:49:48,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:48,707 INFO L225 Difference]: With dead ends: 101 [2024-11-13 15:49:48,707 INFO L226 Difference]: Without dead ends: 101 [2024-11-13 15:49:48,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=92, Invalid=1033, Unknown=1, NotChecked=64, Total=1190 [2024-11-13 15:49:48,708 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 7 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:48,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 495 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 436 Invalid, 0 Unknown, 146 Unchecked, 0.3s Time] [2024-11-13 15:49:48,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-13 15:49:48,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-13 15:49:48,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 95 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:49:48,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2024-11-13 15:49:48,714 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 48 [2024-11-13 15:49:48,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:48,715 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2024-11-13 15:49:48,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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-13 15:49:48,715 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2024-11-13 15:49:48,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-13 15:49:48,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:48,715 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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-13 15:49:48,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-13 15:49:48,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:48,916 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:48,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:48,916 INFO L85 PathProgramCache]: Analyzing trace with hash 887227189, now seen corresponding path program 1 times [2024-11-13 15:49:48,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:48,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203256238] [2024-11-13 15:49:48,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:48,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:50,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:49:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:50,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:49:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:50,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:49:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:51,484 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 15:49:51,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:51,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203256238] [2024-11-13 15:49:51,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203256238] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:51,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797953844] [2024-11-13 15:49:51,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:51,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:51,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:49:51,487 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:49:51,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 15:49:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:51,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-13 15:49:51,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:49:52,348 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 19 treesize of output 1 [2024-11-13 15:49:52,361 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 19 treesize of output 1 [2024-11-13 15:49:52,621 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 55 treesize of output 27 [2024-11-13 15:49:52,626 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 39 treesize of output 11 [2024-11-13 15:49:52,634 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-13 15:49:52,634 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 7 [2024-11-13 15:49:52,862 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-13 15:49:52,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:49:52,898 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 63 treesize of output 52 [2024-11-13 15:49:52,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:49:52,907 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 44 treesize of output 39 [2024-11-13 15:49:52,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:49:52,916 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 61 treesize of output 50 [2024-11-13 15:49:52,941 INFO L349 Elim1Store]: treesize reduction 34, result has 44.3 percent of original size [2024-11-13 15:49:52,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2024-11-13 15:49:53,048 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 60 treesize of output 44 [2024-11-13 15:49:53,051 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 48 treesize of output 32 [2024-11-13 15:49:53,108 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 29 treesize of output 17 [2024-11-13 15:49:53,110 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 32 treesize of output 14 [2024-11-13 15:49:53,201 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2024-11-13 15:49:53,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:49:53,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797953844] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:53,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:49:53,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 43 [2024-11-13 15:49:53,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048210375] [2024-11-13 15:49:53,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:49:53,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-13 15:49:53,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:53,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-13 15:49:53,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2116, Unknown=1, NotChecked=92, Total=2352 [2024-11-13 15:49:53,697 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 44 states, 40 states have (on average 2.075) internal successors, (83), 39 states have internal predecessors, (83), 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-13 15:49:55,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:55,821 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2024-11-13 15:49:55,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-13 15:49:55,821 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 2.075) internal successors, (83), 39 states have internal predecessors, (83), 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 48 [2024-11-13 15:49:55,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:55,822 INFO L225 Difference]: With dead ends: 100 [2024-11-13 15:49:55,822 INFO L226 Difference]: Without dead ends: 100 [2024-11-13 15:49:55,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=281, Invalid=4012, Unknown=1, NotChecked=128, Total=4422 [2024-11-13 15:49:55,824 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 56 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:55,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1082 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1228 Invalid, 0 Unknown, 95 Unchecked, 1.0s Time] [2024-11-13 15:49:55,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-13 15:49:55,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-13 15:49:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.337837837837838) internal successors, (99), 94 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:49:55,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2024-11-13 15:49:55,828 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 48 [2024-11-13 15:49:55,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:55,828 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2024-11-13 15:49:55,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 2.075) internal successors, (83), 39 states have internal predecessors, (83), 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-13 15:49:55,829 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2024-11-13 15:49:55,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-13 15:49:55,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:55,829 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-13 15:49:55,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 15:49:56,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-13 15:49:56,030 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:56,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:56,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1408822098, now seen corresponding path program 1 times [2024-11-13 15:49:56,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:56,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812823318] [2024-11-13 15:49:56,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:56,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:56,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:49:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:56,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:49:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:56,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:49:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 15:49:56,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:56,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812823318] [2024-11-13 15:49:56,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812823318] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:56,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244752211] [2024-11-13 15:49:56,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:56,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:56,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:49:56,373 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:49:56,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 15:49:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:56,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-13 15:49:56,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:49:56,719 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-13 15:49:56,725 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-13 15:49:56,769 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-13 15:49:56,773 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-13 15:49:56,798 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-13 15:49:56,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:49:56,838 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-13 15:49:56,850 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:49:56,850 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-13 15:49:56,897 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-13 15:49:56,920 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-13 15:49:56,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:49:56,960 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-13 15:49:57,024 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-13 15:49:57,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:49:57,067 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-13 15:49:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 14 not checked. [2024-11-13 15:49:57,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:49:57,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244752211] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:57,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:49:57,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2024-11-13 15:49:57,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825368840] [2024-11-13 15:49:57,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:49:57,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 15:49:57,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:57,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 15:49:57,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=263, Unknown=2, NotChecked=66, Total=380 [2024-11-13 15:49:57,239 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 18 states, 17 states have (on average 4.176470588235294) internal successors, (71), 14 states have internal predecessors, (71), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-13 15:49:57,256 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (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|)))) (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-13 15:49:57,258 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_#res#1.base| 0)) (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|)))) (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-13 15:49:57,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:57,569 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2024-11-13 15:49:57,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 15:49:57,570 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.176470588235294) internal successors, (71), 14 states have internal predecessors, (71), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 49 [2024-11-13 15:49:57,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:57,571 INFO L225 Difference]: With dead ends: 94 [2024-11-13 15:49:57,571 INFO L226 Difference]: Without dead ends: 94 [2024-11-13 15:49:57,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=511, Unknown=4, NotChecked=196, Total=812 [2024-11-13 15:49:57,572 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 43 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 291 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:57,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 620 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 371 Invalid, 0 Unknown, 291 Unchecked, 0.2s Time] [2024-11-13 15:49:57,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-13 15:49:57,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-13 15:49:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 71 states have (on average 1.295774647887324) internal successors, (92), 88 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:49:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2024-11-13 15:49:57,582 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 49 [2024-11-13 15:49:57,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:57,582 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2024-11-13 15:49:57,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.176470588235294) internal successors, (71), 14 states have internal predecessors, (71), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-13 15:49:57,583 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2024-11-13 15:49:57,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-13 15:49:57,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:57,583 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1] [2024-11-13 15:49:57,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-13 15:49:57,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:57,784 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:57,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:57,785 INFO L85 PathProgramCache]: Analyzing trace with hash 969528989, now seen corresponding path program 1 times [2024-11-13 15:49:57,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:57,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023584536] [2024-11-13 15:49:57,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:57,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:57,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:49:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:57,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:49:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:57,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:49:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:57,952 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 15:49:57,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:57,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023584536] [2024-11-13 15:49:57,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023584536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:57,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:57,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:49:57,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434820861] [2024-11-13 15:49:57,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:57,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:49:57,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:57,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:49:57,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:49:57,956 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-13 15:49:58,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:58,082 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2024-11-13 15:49:58,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:49:58,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 54 [2024-11-13 15:49:58,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:58,084 INFO L225 Difference]: With dead ends: 93 [2024-11-13 15:49:58,084 INFO L226 Difference]: Without dead ends: 93 [2024-11-13 15:49:58,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-13 15:49:58,084 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:58,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:49:58,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-13 15:49:58,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-13 15:49:58,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 87 states have internal predecessors, (91), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:49:58,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2024-11-13 15:49:58,090 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 54 [2024-11-13 15:49:58,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:58,090 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2024-11-13 15:49:58,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-13 15:49:58,090 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2024-11-13 15:49:58,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-13 15:49:58,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:58,093 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1] [2024-11-13 15:49:58,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 15:49:58,093 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:58,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:58,094 INFO L85 PathProgramCache]: Analyzing trace with hash 969528990, now seen corresponding path program 1 times [2024-11-13 15:49:58,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:58,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215960027] [2024-11-13 15:49:58,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:58,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:58,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:49:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:58,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:49:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:58,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:49:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 15:49:58,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:58,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215960027] [2024-11-13 15:49:58,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215960027] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:58,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337207196] [2024-11-13 15:49:58,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:58,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:58,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:49:58,525 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:49:58,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 15:49:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:58,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 15:49:58,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:49:59,003 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 23 treesize of output 15 [2024-11-13 15:49:59,006 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-13 15:49:59,032 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 15:49:59,033 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:49:59,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337207196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:59,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:49:59,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 15 [2024-11-13 15:49:59,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339177250] [2024-11-13 15:49:59,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:59,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:49:59,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:59,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:49:59,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-11-13 15:49:59,035 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 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-13 15:49:59,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:59,127 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-13 15:49:59,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:49:59,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 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 54 [2024-11-13 15:49:59,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:59,128 INFO L225 Difference]: With dead ends: 92 [2024-11-13 15:49:59,128 INFO L226 Difference]: Without dead ends: 92 [2024-11-13 15:49:59,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-11-13 15:49:59,129 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:59,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 267 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:49:59,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-13 15:49:59,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-13 15:49:59,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.267605633802817) internal successors, (90), 86 states have internal predecessors, (90), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:49:59,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2024-11-13 15:49:59,135 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 54 [2024-11-13 15:49:59,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:59,135 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2024-11-13 15:49:59,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 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-13 15:49:59,135 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2024-11-13 15:49:59,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-13 15:49:59,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:59,137 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:59,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-13 15:49:59,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:59,338 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:59,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:59,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1208575297, now seen corresponding path program 1 times [2024-11-13 15:49:59,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:59,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737590500] [2024-11-13 15:49:59,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:59,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:59,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:49:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:59,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:49:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:59,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:49:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:59,624 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 15:49:59,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:59,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737590500] [2024-11-13 15:49:59,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737590500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:59,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:59,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:49:59,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104683964] [2024-11-13 15:49:59,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:59,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:49:59,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:59,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:49:59,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:49:59,626 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 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-13 15:49:59,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:59,832 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2024-11-13 15:49:59,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:49:59,833 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 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 59 [2024-11-13 15:49:59,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:59,834 INFO L225 Difference]: With dead ends: 96 [2024-11-13 15:49:59,834 INFO L226 Difference]: Without dead ends: 96 [2024-11-13 15:49:59,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:49:59,835 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 29 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:59,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 351 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:49:59,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-13 15:49:59,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2024-11-13 15:49:59,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 86 states have internal predecessors, (91), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:49:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2024-11-13 15:49:59,838 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 59 [2024-11-13 15:49:59,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:59,839 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2024-11-13 15:49:59,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 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-13 15:49:59,839 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2024-11-13 15:49:59,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-13 15:49:59,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:59,842 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:59,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 15:49:59,842 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:49:59,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:59,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1208575296, now seen corresponding path program 1 times [2024-11-13 15:49:59,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:59,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953238496] [2024-11-13 15:49:59,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:59,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:00,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:50:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:00,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:50:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:00,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:50:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:00,797 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 15:50:00,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:00,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953238496] [2024-11-13 15:50:00,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953238496] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:50:00,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966336043] [2024-11-13 15:50:00,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:00,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:50:00,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:50:00,800 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:50:00,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-13 15:50:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:01,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-13 15:50:01,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:50:01,210 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-13 15:50:01,542 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 9 treesize of output 3 [2024-11-13 15:50:01,547 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 9 treesize of output 3 [2024-11-13 15:50:01,604 WARN L873 $PredicateComparison]: unable to prove that (and (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|)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_14|))) (and (<= .cse0 0) (<= 0 (+ .cse0 4)))))) is different from true [2024-11-13 15:50:01,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:50:01,676 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 18 treesize of output 13 [2024-11-13 15:50:01,688 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-13 15:50:01,688 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-13 15:50:01,971 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-13 15:50:01,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:50:01,984 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 40 treesize of output 32 [2024-11-13 15:50:02,067 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2024-11-13 15:50:02,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:50:02,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966336043] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:50:02,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:50:02,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2024-11-13 15:50:02,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591370715] [2024-11-13 15:50:02,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:50:02,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-13 15:50:02,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:02,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-13 15:50:02,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=967, Unknown=1, NotChecked=62, Total=1122 [2024-11-13 15:50:02,397 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 30 states, 28 states have (on average 3.4285714285714284) internal successors, (96), 26 states have internal predecessors, (96), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-13 15:50:03,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:50:03,463 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2024-11-13 15:50:03,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 15:50:03,463 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 3.4285714285714284) internal successors, (96), 26 states have internal predecessors, (96), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 59 [2024-11-13 15:50:03,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:50:03,464 INFO L225 Difference]: With dead ends: 98 [2024-11-13 15:50:03,464 INFO L226 Difference]: Without dead ends: 98 [2024-11-13 15:50:03,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=173, Invalid=1810, Unknown=1, NotChecked=86, Total=2070 [2024-11-13 15:50:03,465 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 66 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:50:03,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 868 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 956 Invalid, 0 Unknown, 95 Unchecked, 0.6s Time] [2024-11-13 15:50:03,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-13 15:50:03,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2024-11-13 15:50:03,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 88 states have internal predecessors, (93), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:50:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2024-11-13 15:50:03,469 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 59 [2024-11-13 15:50:03,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:50:03,469 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2024-11-13 15:50:03,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 3.4285714285714284) internal successors, (96), 26 states have internal predecessors, (96), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-13 15:50:03,469 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2024-11-13 15:50:03,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-13 15:50:03,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:50:03,470 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:50:03,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-13 15:50:03,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-13 15:50:03,671 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:50:03,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:03,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1371473249, now seen corresponding path program 1 times [2024-11-13 15:50:03,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:03,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528238656] [2024-11-13 15:50:03,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:03,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:06,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:50:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:06,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:50:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:06,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:50:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:07,241 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 15:50:07,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:07,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528238656] [2024-11-13 15:50:07,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528238656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:50:07,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084881904] [2024-11-13 15:50:07,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:07,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:50:07,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:50:07,244 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:50:07,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-13 15:50:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:07,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 135 conjuncts are in the unsatisfiable core [2024-11-13 15:50:07,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:50:07,974 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-13 15:50:08,280 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-13 15:50:08,404 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:50:08,404 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-13 15:50:08,567 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 23 treesize of output 11 [2024-11-13 15:50:08,675 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-13 15:50:08,852 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-13 15:50:08,941 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-13 15:50:08,952 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-13 15:50:09,235 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 9 treesize of output 3 [2024-11-13 15:50:09,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 11 treesize of output 3 [2024-11-13 15:50:09,244 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 11 treesize of output 3 [2024-11-13 15:50:09,827 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-13 15:50:09,827 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 20 treesize of output 23 [2024-11-13 15:50:09,850 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-13 15:50:09,850 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-13 15:50:09,858 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 20 treesize of output 15 [2024-11-13 15:50:10,367 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:50:10,368 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:50:10,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 7 [2024-11-13 15:50:10,626 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 27 treesize of output 15 [2024-11-13 15:50:10,655 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 20 treesize of output 15 [2024-11-13 15:50:10,800 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 20 treesize of output 15 [2024-11-13 15:50:11,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:50:11,049 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 43 treesize of output 15 [2024-11-13 15:50:11,165 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 19 treesize of output 11 [2024-11-13 15:50:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:50:11,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:50:11,907 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_ArrVal_4643 (Array Int Int)) (v_ArrVal_4644 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4643)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 .cse1 v_ArrVal_4644) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16|) (not (= (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4644 .cse2))) v_ArrVal_4644))))) is different from false [2024-11-13 15:50:11,952 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4639 Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_ArrVal_4643 (Array Int Int)) (v_ArrVal_4644 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int#2| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_int#2| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_append_~last~1#1.offset| v_ArrVal_4639)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4643)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 .cse1 v_ArrVal_4644) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16|) (not (= v_ArrVal_4644 (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4644 .cse2)))))))) is different from false [2024-11-13 15:50:11,971 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4639 Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_ArrVal_4643 (Array Int Int)) (v_ArrVal_4644 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int#2| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_int#2| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.offset| v_ArrVal_4639)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4643)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16|) (not (= (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4644 .cse2))) v_ArrVal_4644)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 .cse1 v_ArrVal_4644) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) is different from false [2024-11-13 15:50:11,989 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4639 Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_ArrVal_4643 (Array Int Int)) (v_ArrVal_4644 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int#2| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_int#2| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)) v_ArrVal_4639)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4643)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 .cse1 v_ArrVal_4644) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= v_ArrVal_4644 (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4644 .cse2)))))))) is different from false [2024-11-13 15:50:12,013 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4639 Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_ArrVal_4643 (Array Int Int)) (v_ArrVal_4644 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (store (store |c_#memory_int#2| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_int#2| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) (select (select |c_#memory_$Pointer$#2.offset| .cse2) (+ .cse0 4)) v_ArrVal_4639)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4643))) (or (< .cse0 |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse1 .cse2 v_ArrVal_4644) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= v_ArrVal_4644 (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4))) (store (select .cse1 .cse2) .cse3 (select v_ArrVal_4644 .cse3))))))))) is different from false [2024-11-13 15:50:12,046 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4639 Int) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (v_ArrVal_4643 (Array Int Int)) (v_ArrVal_4644 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse1 (store (store |c_#memory_int#2| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_int#2| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) (select (select |c_#memory_$Pointer$#2.offset| .cse2) (+ .cse0 4)) v_ArrVal_4639)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4643))) (or (< .cse0 |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse1 .cse2 v_ArrVal_4644) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= v_ArrVal_4644 (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4))) (store (select .cse1 .cse2) .cse3 (select v_ArrVal_4644 .cse3))))))))) is different from false [2024-11-13 15:50:12,070 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4639 Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_ArrVal_4643 (Array Int Int)) (v_ArrVal_4644 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (store (store |c_#memory_int#2| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_int#2| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) (select (select |c_#memory_$Pointer$#2.offset| .cse1) (+ .cse3 4)) v_ArrVal_4639)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4643))) (or (not (= (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4644 .cse2))) v_ArrVal_4644)) (< .cse3 |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 .cse1 v_ArrVal_4644) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))))) is different from false [2024-11-13 15:50:12,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084881904] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:50:12,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:50:12,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 68 [2024-11-13 15:50:12,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881140216] [2024-11-13 15:50:12,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:50:12,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-11-13 15:50:12,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:12,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-11-13 15:50:12,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=5078, Unknown=45, NotChecked=1050, Total=6480 [2024-11-13 15:50:12,367 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 68 states, 64 states have (on average 1.703125) internal successors, (109), 59 states have internal predecessors, (109), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 15:50:16,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:50:16,263 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2024-11-13 15:50:16,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-13 15:50:16,264 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 64 states have (on average 1.703125) internal successors, (109), 59 states have internal predecessors, (109), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2024-11-13 15:50:16,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:50:16,265 INFO L225 Difference]: With dead ends: 98 [2024-11-13 15:50:16,265 INFO L226 Difference]: Without dead ends: 98 [2024-11-13 15:50:16,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2434 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=581, Invalid=9704, Unknown=45, NotChecked=1442, Total=11772 [2024-11-13 15:50:16,268 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 75 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 2119 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1723 SdHoareTripleChecker+Invalid, 2140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:50:16,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1723 Invalid, 2140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2119 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-13 15:50:16,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-13 15:50:16,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2024-11-13 15:50:16,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 88 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 15:50:16,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2024-11-13 15:50:16,270 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 63 [2024-11-13 15:50:16,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:50:16,270 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2024-11-13 15:50:16,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 64 states have (on average 1.703125) internal successors, (109), 59 states have internal predecessors, (109), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 15:50:16,271 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2024-11-13 15:50:16,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-13 15:50:16,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:50:16,271 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:50:16,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-13 15:50:16,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-13 15:50:16,472 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-13 15:50:16,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:16,472 INFO L85 PathProgramCache]: Analyzing trace with hash -572086354, now seen corresponding path program 1 times [2024-11-13 15:50:16,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:16,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471441843] [2024-11-13 15:50:16,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:16,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 15:50:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 15:50:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:50:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,826 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 15:50:18,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:18,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471441843] [2024-11-13 15:50:18,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471441843] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:50:18,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964763871] [2024-11-13 15:50:18,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:18,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:50:18,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:50:18,828 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:50:18,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_682a917e-8c4b-4bc2-adba-a48f03eef9f2/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-13 15:50:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:19,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-11-13 15:50:19,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:50:19,279 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-13 15:50:19,467 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:50:19,467 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-13 15:50:19,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 15:50:19,646 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-13 15:50:19,755 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-13 15:50:19,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-13 15:50:20,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:50:20,060 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 71 treesize of output 17 [2024-11-13 15:50:20,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 15:50:20,294 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse0)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select .cse2 (+ .cse3 4)))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 1) (not (= .cse0 .cse1)) (= (select .cse2 .cse3) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_49| .cse0) 1))))))) is different from false [2024-11-13 15:50:20,296 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse0)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select .cse2 (+ .cse3 4)))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 1) (not (= .cse0 .cse1)) (= (select .cse2 .cse3) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_49| .cse0) 1))))))) is different from true [2024-11-13 15:50:20,320 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse0)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select .cse2 (+ .cse3 4)))) (and (not (= .cse0 .cse1)) (= (select .cse2 .cse3) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse0) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1))))) is different from false [2024-11-13 15:50:20,323 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse0)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select .cse2 (+ .cse3 4)))) (and (not (= .cse0 .cse1)) (= (select .cse2 .cse3) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse0) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1))))) is different from true [2024-11-13 15:50:20,400 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse0)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select .cse2 (+ .cse3 4)))) (and (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (not (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset|) (= (select .cse2 .cse3) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse0) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1))))) is different from false [2024-11-13 15:50:20,403 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse0)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select .cse2 (+ .cse3 4)))) (and (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (not (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset|) (= (select .cse2 .cse3) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse0) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1))))) is different from true [2024-11-13 15:50:20,438 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse0)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select .cse2 (+ .cse3 4)))) (and (not (= .cse0 .cse1)) (= (select .cse2 .cse3) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse0) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))))))) is different from false [2024-11-13 15:50:20,441 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse0)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select .cse2 (+ .cse3 4)))) (and (not (= .cse0 .cse1)) (= (select .cse2 .cse3) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse0) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))))))) is different from true [2024-11-13 15:50:20,472 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse0)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select .cse2 (+ .cse3 4)))) (and (not (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)) |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|) (= (select .cse2 .cse3) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse0) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1))))) is different from false [2024-11-13 15:50:20,474 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse0)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select .cse2 (+ .cse3 4)))) (and (not (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)) |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|) (= (select .cse2 .cse3) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse0) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1))))) is different from true [2024-11-13 15:50:20,587 INFO L349 Elim1Store]: treesize reduction 104, result has 60.6 percent of original size [2024-11-13 15:50:20,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 110 treesize of output 186 [2024-11-13 15:50:21,140 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse5 (+ .cse6 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| .cse0)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$#2.base| .cse11) .cse5))) (let ((.cse12 (= .cse10 .cse0)) (.cse13 (select .cse16 .cse4)) (.cse1 (select .cse16 (+ .cse4 4)))) (or (and (not (= .cse0 .cse1)) (let ((.cse9 (= .cse13 .cse1)) (.cse8 (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse10) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|))))) (let ((.cse3 (or (and .cse12 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse13)) (and .cse9 (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse10) .cse8)))) (.cse2 (not (= .cse0 .cse11))) (.cse7 (and (= .cse10 .cse1) .cse9 (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse1) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|)))))) (or (and .cse2 .cse3) (and (not (= .cse4 .cse5)) (or (and (not (= .cse4 .cse6)) .cse3) .cse7 (and .cse8 .cse2 .cse9))) .cse7))) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse14 (select |c_#valid| .cse14)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse0) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse15 (select |c_#valid| .cse15)))) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_49| .cse13) 1))) .cse12 (not (= .cse13 .cse0)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1)) is different from false [2024-11-13 15:50:21,145 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse5 (+ .cse6 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| .cse0)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$#2.base| .cse11) .cse5))) (let ((.cse12 (= .cse10 .cse0)) (.cse13 (select .cse16 .cse4)) (.cse1 (select .cse16 (+ .cse4 4)))) (or (and (not (= .cse0 .cse1)) (let ((.cse9 (= .cse13 .cse1)) (.cse8 (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse10) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|))))) (let ((.cse3 (or (and .cse12 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse13)) (and .cse9 (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse10) .cse8)))) (.cse2 (not (= .cse0 .cse11))) (.cse7 (and (= .cse10 .cse1) .cse9 (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse1) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|)))))) (or (and .cse2 .cse3) (and (not (= .cse4 .cse5)) (or (and (not (= .cse4 .cse6)) .cse3) .cse7 (and .cse8 .cse2 .cse9))) .cse7))) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse14 (select |c_#valid| .cse14)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse0) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse15 (select |c_#valid| .cse15)))) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_49| .cse13) 1))) .cse12 (not (= .cse13 .cse0)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1)) is different from true [2024-11-13 15:50:21,345 INFO L349 Elim1Store]: treesize reduction 120, result has 36.5 percent of original size [2024-11-13 15:50:21,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 664 treesize of output 510 [2024-11-13 15:50:23,475 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-13 15:50:23,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 256 treesize of output 220 [2024-11-13 15:50:23,487 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 288 treesize of output 256 [2024-11-13 15:50:23,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:50:23,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 297 treesize of output 289 [2024-11-13 15:50:23,662 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 329 treesize of output 289 [2024-11-13 15:50:23,764 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 28 treesize of output 12 [2024-11-13 15:50:23,794 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 32 treesize of output 16 [2024-11-13 15:50:23,809 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 32 treesize of output 16 [2024-11-13 15:50:23,840 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 32 treesize of output 16 [2024-11-13 15:50:23,877 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 42 treesize of output 26 [2024-11-13 15:50:23,917 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 42 treesize of output 26 [2024-11-13 15:50:23,936 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 28 treesize of output 12 [2024-11-13 15:50:23,952 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 32 treesize of output 16 [2024-11-13 15:50:23,977 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 32 treesize of output 16 [2024-11-13 15:50:24,043 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-13 15:50:24,043 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 47 treesize of output 29 [2024-11-13 15:50:24,077 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 28 treesize of output 12 [2024-11-13 15:50:24,106 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 32 treesize of output 16 [2024-11-13 15:50:24,121 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 32 treesize of output 16 [2024-11-13 15:50:24,140 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 32 treesize of output 16 [2024-11-13 15:50:24,179 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-13 15:50:24,180 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 47 treesize of output 29 [2024-11-13 15:50:24,203 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 28 treesize of output 12 [2024-11-13 15:50:24,224 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 32 treesize of output 16 [2024-11-13 15:50:24,262 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 32 treesize of output 16 [2024-11-13 15:50:24,303 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 32 treesize of output 16 [2024-11-13 15:50:24,572 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse19 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse58 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse24 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse51 (select |c_#memory_$Pointer$#2.base| .cse24)) (.cse20 (+ .cse58 4)) (.cse59 (select |c_#memory_$Pointer$#2.base| .cse19)) (.cse53 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse37 (select .cse59 (+ .cse53 4))) (.cse56 (select .cse59 .cse53)) (.cse45 (select .cse51 .cse20))) (let ((.cse55 (= .cse45 .cse19)) (.cse23 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse56)) (.cse38 (select |c_#memory_$Pointer$#2.base| .cse37))) (let ((.cse9 (exists ((v_prenex_11 Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse38 v_prenex_11)))) (.cse8 (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse38 |ULTIMATE.start_dll_circular_append_~last~1#1.offset|)))) (.cse13 (not (= .cse53 .cse58))) (.cse50 (and .cse55 .cse23)) (.cse7 (= .cse56 .cse37)) (.cse42 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse45)) (.cse54 (select |c_#memory_$Pointer$#2.base| .cse45)) (.cse21 (not (= .cse19 .cse24))) (.cse17 (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse57 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse57 (select |c_#valid| .cse57)))) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse19) 1) (= (select |v_old(#valid)_AFTER_CALL_49| .cse56) 1)))) (.cse22 (not (= .cse56 .cse19))) (.cse16 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse37))) (let ((.cse1 (and .cse17 .cse55 .cse22 .cse16)) (.cse10 (and (or .cse50 (and .cse7 (or .cse42 (exists ((v_prenex_12 Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse54 v_prenex_12)))))) .cse21)) (.cse4 (and (or .cse50 (and (or .cse42 (exists ((v_prenex_10 Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse54 v_prenex_10)))) .cse7)) .cse13)) (.cse5 (and .cse21 .cse7 (exists ((v_prenex_9 Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse54 v_prenex_9))))) (.cse6 (= .cse45 .cse37)) (.cse27 (and .cse7 .cse8)) (.cse32 (and .cse7 .cse9)) (.cse0 (not (= .cse24 .cse37))) (.cse39 (or (= .cse51 .cse38) .cse16)) (.cse2 (not (= .cse19 .cse37))) (.cse3 (not (= .cse53 .cse20))) (.cse11 (exists ((v_prenex_13 (Array Int Int))) (and (= 0 (select v_prenex_13 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= |c_#valid| (let ((.cse52 (@diff v_prenex_13 |c_#valid|))) (store v_prenex_13 .cse52 (select |c_#valid| .cse52)))) (= (select v_prenex_13 .cse37) 1) (= (select v_prenex_13 .cse19) 1)))) (.cse40 (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse51 |ULTIMATE.start_dll_circular_append_~last~1#1.offset|)))) (.cse41 (exists ((v_prenex_11 Int)) (= (select .cse51 v_prenex_11) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (or (and .cse0 (or .cse1 (and .cse2 (or (and .cse3 (or .cse4 .cse5 (and .cse6 .cse7 .cse8))) (and .cse6 .cse7 .cse9) .cse10) .cse11))) (and (let ((.cse36 (select .cse38 .cse20))) (let ((.cse33 (= .cse19 .cse36))) (let ((.cse14 (and .cse21 .cse7)) (.cse15 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse36)) (.cse12 (and .cse23 .cse33))) (or (and .cse2 (or (and (or (and .cse3 (or .cse7 .cse12) .cse13) .cse14) .cse15) (and .cse7 .cse16)) .cse11) (and .cse17 (or (exists ((v_DerPreprocessor_28 Int)) (let ((.cse18 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_28) .cse20))) (and (= v_DerPreprocessor_28 .cse18) (= .cse18 .cse19)))) .cse21) .cse22 .cse16) (and .cse2 (or (and (or .cse23 (and .cse7 (or (exists ((v_prenex_12 Int) (v_arrayElimCell_119 Int)) (and (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_119) v_prenex_12)) (not (= v_arrayElimCell_119 .cse24)))) (exists ((v_prenex_12 Int) (v_DerPreprocessor_20 Int)) (let ((.cse25 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_20) .cse20))) (and (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse25) v_prenex_12)) (= v_DerPreprocessor_20 .cse25)))) (exists ((v_DerPreprocessor_19 Int)) (let ((.cse26 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_19) .cse20))) (and (= .cse26 v_DerPreprocessor_19) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse26))))))) .cse21) (and .cse3 (or .cse27 (and (or (and (or (exists ((v_arrayElimCell_113 Int) (v_prenex_10 Int)) (and (not (= v_arrayElimCell_113 .cse24)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_113) v_prenex_10)))) (exists ((v_DerPreprocessor_14 Int) (v_prenex_10 Int)) (let ((.cse28 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_14) .cse20))) (and (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse28) v_prenex_10)) (= v_DerPreprocessor_14 .cse28)))) (exists ((v_DerPreprocessor_13 Int)) (let ((.cse29 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_13) .cse20))) (and (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse29) (= .cse29 v_DerPreprocessor_13))))) .cse7) (and .cse23 (or .cse21 (exists ((v_DerPreprocessor_15 Int)) (let ((.cse30 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_15) .cse20))) (and (= .cse30 .cse19) (= .cse30 v_DerPreprocessor_15))))))) .cse13) (and (or (exists ((v_arrayElimCell_115 Int) (v_prenex_9 Int)) (and (not (= v_arrayElimCell_115 .cse24)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_115) v_prenex_9)))) (exists ((v_DerPreprocessor_16 Int) (v_prenex_9 Int)) (let ((.cse31 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_16) .cse20))) (and (= v_DerPreprocessor_16 .cse31) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse31) v_prenex_9)))))) .cse21 .cse7))) .cse32) .cse0 .cse11) (and .cse2 .cse0 (or .cse14 (and .cse3 (or (and .cse23 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse19)) .cse7) .cse13)) .cse11) (let ((.cse34 (select |c_#memory_$Pointer$#2.base| .cse36))) (and (or (and .cse17 .cse22 .cse33 .cse16) (and (let ((.cse35 (= .cse36 .cse37))) (or (and (or (and (or (and (or .cse15 (exists ((v_prenex_10 Int)) (= (select .cse34 v_prenex_10) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse7) .cse12) .cse13) (and (exists ((v_prenex_9 Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse34 v_prenex_9))) .cse21 .cse7) (and .cse7 .cse8 .cse35)) .cse3) (and .cse7 .cse35 .cse9) (and .cse21 (or (and (or (exists ((v_prenex_12 Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse34 v_prenex_12))) .cse15) .cse7) .cse12)))) .cse2 .cse11)) (or (= .cse34 .cse38) (not (= .cse24 .cse36))))))))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse24)) (and .cse39 (or .cse1 (and (or .cse10 (and .cse3 (or .cse4 (and .cse6 .cse40 .cse7) .cse5)) (and .cse6 .cse41 .cse7)) .cse2 .cse11))) (and .cse42 (let ((.cse49 (or .cse50 .cse7))) (let ((.cse43 (and .cse49 .cse21)) (.cse48 (and .cse41 .cse7)) (.cse47 (and .cse40 .cse7)) (.cse44 (and .cse49 .cse13))) (or (and (or .cse43 .cse32 (and .cse3 (or .cse27 .cse44))) .cse2 .cse0 .cse11) (and (not (= .cse45 .cse24)) (let ((.cse46 (and .cse13 .cse7))) (or (and (or .cse43 (and .cse3 (or .cse27 .cse46)) .cse32) .cse2 .cse0 .cse11) (and .cse39 .cse2 (or .cse43 (and .cse3 (or .cse47 .cse46)) .cse48) .cse11)))) (and .cse39 .cse2 (or .cse43 .cse48 (and .cse3 (or .cse47 .cse44))) .cse11)))))))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1)) is different from false [2024-11-13 15:50:24,580 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse19 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse58 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse24 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse51 (select |c_#memory_$Pointer$#2.base| .cse24)) (.cse20 (+ .cse58 4)) (.cse59 (select |c_#memory_$Pointer$#2.base| .cse19)) (.cse53 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse37 (select .cse59 (+ .cse53 4))) (.cse56 (select .cse59 .cse53)) (.cse45 (select .cse51 .cse20))) (let ((.cse55 (= .cse45 .cse19)) (.cse23 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse56)) (.cse38 (select |c_#memory_$Pointer$#2.base| .cse37))) (let ((.cse9 (exists ((v_prenex_11 Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse38 v_prenex_11)))) (.cse8 (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse38 |ULTIMATE.start_dll_circular_append_~last~1#1.offset|)))) (.cse13 (not (= .cse53 .cse58))) (.cse50 (and .cse55 .cse23)) (.cse7 (= .cse56 .cse37)) (.cse42 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse45)) (.cse54 (select |c_#memory_$Pointer$#2.base| .cse45)) (.cse21 (not (= .cse19 .cse24))) (.cse17 (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse57 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse57 (select |c_#valid| .cse57)))) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse19) 1) (= (select |v_old(#valid)_AFTER_CALL_49| .cse56) 1)))) (.cse22 (not (= .cse56 .cse19))) (.cse16 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse37))) (let ((.cse1 (and .cse17 .cse55 .cse22 .cse16)) (.cse10 (and (or .cse50 (and .cse7 (or .cse42 (exists ((v_prenex_12 Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse54 v_prenex_12)))))) .cse21)) (.cse4 (and (or .cse50 (and (or .cse42 (exists ((v_prenex_10 Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse54 v_prenex_10)))) .cse7)) .cse13)) (.cse5 (and .cse21 .cse7 (exists ((v_prenex_9 Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse54 v_prenex_9))))) (.cse6 (= .cse45 .cse37)) (.cse27 (and .cse7 .cse8)) (.cse32 (and .cse7 .cse9)) (.cse0 (not (= .cse24 .cse37))) (.cse39 (or (= .cse51 .cse38) .cse16)) (.cse2 (not (= .cse19 .cse37))) (.cse3 (not (= .cse53 .cse20))) (.cse11 (exists ((v_prenex_13 (Array Int Int))) (and (= 0 (select v_prenex_13 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= |c_#valid| (let ((.cse52 (@diff v_prenex_13 |c_#valid|))) (store v_prenex_13 .cse52 (select |c_#valid| .cse52)))) (= (select v_prenex_13 .cse37) 1) (= (select v_prenex_13 .cse19) 1)))) (.cse40 (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse51 |ULTIMATE.start_dll_circular_append_~last~1#1.offset|)))) (.cse41 (exists ((v_prenex_11 Int)) (= (select .cse51 v_prenex_11) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (or (and .cse0 (or .cse1 (and .cse2 (or (and .cse3 (or .cse4 .cse5 (and .cse6 .cse7 .cse8))) (and .cse6 .cse7 .cse9) .cse10) .cse11))) (and (let ((.cse36 (select .cse38 .cse20))) (let ((.cse33 (= .cse19 .cse36))) (let ((.cse14 (and .cse21 .cse7)) (.cse15 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse36)) (.cse12 (and .cse23 .cse33))) (or (and .cse2 (or (and (or (and .cse3 (or .cse7 .cse12) .cse13) .cse14) .cse15) (and .cse7 .cse16)) .cse11) (and .cse17 (or (exists ((v_DerPreprocessor_28 Int)) (let ((.cse18 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_28) .cse20))) (and (= v_DerPreprocessor_28 .cse18) (= .cse18 .cse19)))) .cse21) .cse22 .cse16) (and .cse2 (or (and (or .cse23 (and .cse7 (or (exists ((v_prenex_12 Int) (v_arrayElimCell_119 Int)) (and (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_119) v_prenex_12)) (not (= v_arrayElimCell_119 .cse24)))) (exists ((v_prenex_12 Int) (v_DerPreprocessor_20 Int)) (let ((.cse25 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_20) .cse20))) (and (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse25) v_prenex_12)) (= v_DerPreprocessor_20 .cse25)))) (exists ((v_DerPreprocessor_19 Int)) (let ((.cse26 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_19) .cse20))) (and (= .cse26 v_DerPreprocessor_19) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse26))))))) .cse21) (and .cse3 (or .cse27 (and (or (and (or (exists ((v_arrayElimCell_113 Int) (v_prenex_10 Int)) (and (not (= v_arrayElimCell_113 .cse24)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_113) v_prenex_10)))) (exists ((v_DerPreprocessor_14 Int) (v_prenex_10 Int)) (let ((.cse28 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_14) .cse20))) (and (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse28) v_prenex_10)) (= v_DerPreprocessor_14 .cse28)))) (exists ((v_DerPreprocessor_13 Int)) (let ((.cse29 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_13) .cse20))) (and (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse29) (= .cse29 v_DerPreprocessor_13))))) .cse7) (and .cse23 (or .cse21 (exists ((v_DerPreprocessor_15 Int)) (let ((.cse30 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_15) .cse20))) (and (= .cse30 .cse19) (= .cse30 v_DerPreprocessor_15))))))) .cse13) (and (or (exists ((v_arrayElimCell_115 Int) (v_prenex_9 Int)) (and (not (= v_arrayElimCell_115 .cse24)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_115) v_prenex_9)))) (exists ((v_DerPreprocessor_16 Int) (v_prenex_9 Int)) (let ((.cse31 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_16) .cse20))) (and (= v_DerPreprocessor_16 .cse31) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse31) v_prenex_9)))))) .cse21 .cse7))) .cse32) .cse0 .cse11) (and .cse2 .cse0 (or .cse14 (and .cse3 (or (and .cse23 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse19)) .cse7) .cse13)) .cse11) (let ((.cse34 (select |c_#memory_$Pointer$#2.base| .cse36))) (and (or (and .cse17 .cse22 .cse33 .cse16) (and (let ((.cse35 (= .cse36 .cse37))) (or (and (or (and (or (and (or .cse15 (exists ((v_prenex_10 Int)) (= (select .cse34 v_prenex_10) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse7) .cse12) .cse13) (and (exists ((v_prenex_9 Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse34 v_prenex_9))) .cse21 .cse7) (and .cse7 .cse8 .cse35)) .cse3) (and .cse7 .cse35 .cse9) (and .cse21 (or (and (or (exists ((v_prenex_12 Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse34 v_prenex_12))) .cse15) .cse7) .cse12)))) .cse2 .cse11)) (or (= .cse34 .cse38) (not (= .cse24 .cse36))))))))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse24)) (and .cse39 (or .cse1 (and (or .cse10 (and .cse3 (or .cse4 (and .cse6 .cse40 .cse7) .cse5)) (and .cse6 .cse41 .cse7)) .cse2 .cse11))) (and .cse42 (let ((.cse49 (or .cse50 .cse7))) (let ((.cse43 (and .cse49 .cse21)) (.cse48 (and .cse41 .cse7)) (.cse47 (and .cse40 .cse7)) (.cse44 (and .cse49 .cse13))) (or (and (or .cse43 .cse32 (and .cse3 (or .cse27 .cse44))) .cse2 .cse0 .cse11) (and (not (= .cse45 .cse24)) (let ((.cse46 (and .cse13 .cse7))) (or (and (or .cse43 (and .cse3 (or .cse27 .cse46)) .cse32) .cse2 .cse0 .cse11) (and .cse39 .cse2 (or .cse43 (and .cse3 (or .cse47 .cse46)) .cse48) .cse11)))) (and .cse39 .cse2 (or .cse43 .cse48 (and .cse3 (or .cse47 .cse44))) .cse11)))))))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1)) is different from true [2024-11-13 15:50:26,555 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse58 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse25 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse51 (select |c_#memory_$Pointer$#2.base| .cse25)) (.cse12 (+ .cse58 4)) (.cse59 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse53 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse23 (select .cse59 (+ .cse53 4))) (.cse56 (select .cse59 .cse53)) (.cse45 (select .cse51 .cse12))) (let ((.cse55 (= .cse45 .cse11)) (.cse16 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse56)) (.cse24 (select |c_#memory_$Pointer$#2.base| .cse23))) (let ((.cse21 (exists ((v_prenex_11 Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse24 v_prenex_11)))) (.cse19 (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse24 |ULTIMATE.start_dll_circular_append_~last~1#1.offset|)))) (.cse4 (not (= .cse53 .cse58))) (.cse50 (and .cse55 .cse16)) (.cse2 (= .cse56 .cse23)) (.cse42 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse45)) (.cse54 (select |c_#memory_$Pointer$#2.base| .cse45)) (.cse13 (not (= .cse11 .cse25))) (.cse9 (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse57 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse57 (select |c_#valid| .cse57)))) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse11) 1) (= (select |v_old(#valid)_AFTER_CALL_49| .cse56) 1)))) (.cse14 (not (= .cse56 .cse11))) (.cse7 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse23))) (let ((.cse34 (and .cse9 .cse55 .cse14 .cse7)) (.cse38 (and (or .cse50 (and .cse2 (or .cse42 (exists ((v_prenex_12 Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse54 v_prenex_12)))))) .cse13)) (.cse35 (and (or .cse50 (and (or .cse42 (exists ((v_prenex_10 Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse54 v_prenex_10)))) .cse2)) .cse4)) (.cse36 (and .cse13 .cse2 (exists ((v_prenex_9 Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse54 v_prenex_9))))) (.cse37 (= .cse45 .cse23)) (.cse29 (and .cse2 .cse19)) (.cse28 (and .cse2 .cse21)) (.cse15 (not (= .cse25 .cse23))) (.cse39 (or (= .cse51 .cse24) .cse7)) (.cse0 (not (= .cse11 .cse23))) (.cse1 (not (= .cse53 .cse12))) (.cse8 (exists ((v_prenex_13 (Array Int Int))) (and (= 0 (select v_prenex_13 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= |c_#valid| (let ((.cse52 (@diff v_prenex_13 |c_#valid|))) (store v_prenex_13 .cse52 (select |c_#valid| .cse52)))) (= (select v_prenex_13 .cse23) 1) (= (select v_prenex_13 .cse11) 1)))) (.cse40 (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse51 |ULTIMATE.start_dll_circular_append_~last~1#1.offset|)))) (.cse41 (exists ((v_prenex_11 Int)) (= (select .cse51 v_prenex_11) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (or (and (let ((.cse22 (select .cse24 .cse12))) (let ((.cse17 (= .cse11 .cse22))) (let ((.cse5 (and .cse13 .cse2)) (.cse6 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse22)) (.cse3 (and .cse16 .cse17))) (or (and .cse0 (or (and (or (and .cse1 (or .cse2 .cse3) .cse4) .cse5) .cse6) (and .cse2 .cse7)) .cse8) (and .cse9 (or (exists ((v_DerPreprocessor_28 Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_28) .cse12))) (and (= v_DerPreprocessor_28 .cse10) (= .cse10 .cse11)))) .cse13) .cse14 .cse7) (and .cse0 .cse15 (or .cse5 (and .cse1 (or (and .cse16 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse11)) .cse2) .cse4)) .cse8) (let ((.cse18 (select |c_#memory_$Pointer$#2.base| .cse22))) (and (or (and .cse9 .cse14 .cse17 .cse7) (and (let ((.cse20 (= .cse22 .cse23))) (or (and (or (and (or (and (or .cse6 (exists ((v_prenex_10 Int)) (= (select .cse18 v_prenex_10) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse2) .cse3) .cse4) (and (exists ((v_prenex_9 Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse18 v_prenex_9))) .cse13 .cse2) (and .cse2 .cse19 .cse20)) .cse1) (and .cse2 .cse20 .cse21) (and .cse13 (or (and (or (exists ((v_prenex_12 Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse18 v_prenex_12))) .cse6) .cse2) .cse3)))) .cse0 .cse8)) (or (= .cse18 .cse24) (not (= .cse25 .cse22))))) (and (or (and (or .cse16 (and .cse2 (or (exists ((v_prenex_12 Int) (v_arrayElimCell_119 Int)) (and (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_119) v_prenex_12)) (not (= v_arrayElimCell_119 .cse25)))) (exists ((v_prenex_12 Int) (v_DerPreprocessor_20 Int)) (let ((.cse26 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_20) .cse12))) (and (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse26) v_prenex_12)) (= v_DerPreprocessor_20 .cse26)))) (exists ((v_DerPreprocessor_19 Int)) (let ((.cse27 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_19) .cse12))) (and (= .cse27 v_DerPreprocessor_19) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse27))))))) .cse13) .cse28 (and .cse1 (or .cse29 (and .cse4 (or (and (exists ((v_DerPreprocessor_15 Int)) (let ((.cse30 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_15) .cse12))) (and (= .cse30 .cse11) (= .cse30 v_DerPreprocessor_15)))) .cse16) (and (or (exists ((v_arrayElimCell_113 Int) (v_prenex_10 Int)) (and (not (= v_arrayElimCell_113 .cse25)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_113) v_prenex_10)))) (exists ((v_DerPreprocessor_14 Int) (v_prenex_10 Int)) (let ((.cse31 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_14) .cse12))) (and (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse31) v_prenex_10)) (= v_DerPreprocessor_14 .cse31)))) (exists ((v_DerPreprocessor_13 Int)) (let ((.cse32 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_13) .cse12))) (and (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse32) (= .cse32 v_DerPreprocessor_13))))) .cse2))) (and (or (exists ((v_arrayElimCell_115 Int) (v_prenex_9 Int)) (and (not (= v_arrayElimCell_115 .cse25)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_115) v_prenex_9)))) (exists ((v_DerPreprocessor_16 Int) (v_prenex_9 Int)) (let ((.cse33 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_16) .cse12))) (and (= v_DerPreprocessor_16 .cse33) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse33) v_prenex_9)))))) .cse13 .cse2)))) .cse0 .cse15 .cse8))))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse25)) (and .cse15 (or .cse34 (and .cse0 (or (and .cse1 (or .cse35 .cse36 (and .cse37 .cse2 .cse19))) (and .cse37 .cse2 .cse21) .cse38) .cse8))) (and .cse39 (or .cse34 (and (or .cse38 (and .cse1 (or .cse35 (and .cse37 .cse40 .cse2) .cse36)) (and .cse37 .cse41 .cse2)) .cse0 .cse8))) (and .cse42 (let ((.cse49 (or .cse50 .cse2))) (let ((.cse43 (and .cse49 .cse13)) (.cse48 (and .cse41 .cse2)) (.cse47 (and .cse40 .cse2)) (.cse44 (and .cse49 .cse4))) (or (and (or .cse43 .cse28 (and .cse1 (or .cse29 .cse44))) .cse0 .cse15 .cse8) (and (not (= .cse45 .cse25)) (let ((.cse46 (and .cse4 .cse2))) (or (and (or .cse43 (and .cse1 (or .cse29 .cse46)) .cse28) .cse0 .cse15 .cse8) (and .cse39 .cse0 (or .cse43 (and .cse1 (or .cse47 .cse46)) .cse48) .cse8)))) (and .cse39 .cse0 (or .cse43 .cse48 (and .cse1 (or .cse47 .cse44))) .cse8)))))))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1)) is different from false [2024-11-13 15:50:26,562 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse58 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse25 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse51 (select |c_#memory_$Pointer$#2.base| .cse25)) (.cse12 (+ .cse58 4)) (.cse59 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse53 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse23 (select .cse59 (+ .cse53 4))) (.cse56 (select .cse59 .cse53)) (.cse45 (select .cse51 .cse12))) (let ((.cse55 (= .cse45 .cse11)) (.cse16 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse56)) (.cse24 (select |c_#memory_$Pointer$#2.base| .cse23))) (let ((.cse21 (exists ((v_prenex_11 Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse24 v_prenex_11)))) (.cse19 (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse24 |ULTIMATE.start_dll_circular_append_~last~1#1.offset|)))) (.cse4 (not (= .cse53 .cse58))) (.cse50 (and .cse55 .cse16)) (.cse2 (= .cse56 .cse23)) (.cse42 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse45)) (.cse54 (select |c_#memory_$Pointer$#2.base| .cse45)) (.cse13 (not (= .cse11 .cse25))) (.cse9 (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse57 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse57 (select |c_#valid| .cse57)))) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse11) 1) (= (select |v_old(#valid)_AFTER_CALL_49| .cse56) 1)))) (.cse14 (not (= .cse56 .cse11))) (.cse7 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse23))) (let ((.cse34 (and .cse9 .cse55 .cse14 .cse7)) (.cse38 (and (or .cse50 (and .cse2 (or .cse42 (exists ((v_prenex_12 Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse54 v_prenex_12)))))) .cse13)) (.cse35 (and (or .cse50 (and (or .cse42 (exists ((v_prenex_10 Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse54 v_prenex_10)))) .cse2)) .cse4)) (.cse36 (and .cse13 .cse2 (exists ((v_prenex_9 Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse54 v_prenex_9))))) (.cse37 (= .cse45 .cse23)) (.cse29 (and .cse2 .cse19)) (.cse28 (and .cse2 .cse21)) (.cse15 (not (= .cse25 .cse23))) (.cse39 (or (= .cse51 .cse24) .cse7)) (.cse0 (not (= .cse11 .cse23))) (.cse1 (not (= .cse53 .cse12))) (.cse8 (exists ((v_prenex_13 (Array Int Int))) (and (= 0 (select v_prenex_13 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= |c_#valid| (let ((.cse52 (@diff v_prenex_13 |c_#valid|))) (store v_prenex_13 .cse52 (select |c_#valid| .cse52)))) (= (select v_prenex_13 .cse23) 1) (= (select v_prenex_13 .cse11) 1)))) (.cse40 (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse51 |ULTIMATE.start_dll_circular_append_~last~1#1.offset|)))) (.cse41 (exists ((v_prenex_11 Int)) (= (select .cse51 v_prenex_11) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (or (and (let ((.cse22 (select .cse24 .cse12))) (let ((.cse17 (= .cse11 .cse22))) (let ((.cse5 (and .cse13 .cse2)) (.cse6 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse22)) (.cse3 (and .cse16 .cse17))) (or (and .cse0 (or (and (or (and .cse1 (or .cse2 .cse3) .cse4) .cse5) .cse6) (and .cse2 .cse7)) .cse8) (and .cse9 (or (exists ((v_DerPreprocessor_28 Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_28) .cse12))) (and (= v_DerPreprocessor_28 .cse10) (= .cse10 .cse11)))) .cse13) .cse14 .cse7) (and .cse0 .cse15 (or .cse5 (and .cse1 (or (and .cse16 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse11)) .cse2) .cse4)) .cse8) (let ((.cse18 (select |c_#memory_$Pointer$#2.base| .cse22))) (and (or (and .cse9 .cse14 .cse17 .cse7) (and (let ((.cse20 (= .cse22 .cse23))) (or (and (or (and (or (and (or .cse6 (exists ((v_prenex_10 Int)) (= (select .cse18 v_prenex_10) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) .cse2) .cse3) .cse4) (and (exists ((v_prenex_9 Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse18 v_prenex_9))) .cse13 .cse2) (and .cse2 .cse19 .cse20)) .cse1) (and .cse2 .cse20 .cse21) (and .cse13 (or (and (or (exists ((v_prenex_12 Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse18 v_prenex_12))) .cse6) .cse2) .cse3)))) .cse0 .cse8)) (or (= .cse18 .cse24) (not (= .cse25 .cse22))))) (and (or (and (or .cse16 (and .cse2 (or (exists ((v_prenex_12 Int) (v_arrayElimCell_119 Int)) (and (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_119) v_prenex_12)) (not (= v_arrayElimCell_119 .cse25)))) (exists ((v_prenex_12 Int) (v_DerPreprocessor_20 Int)) (let ((.cse26 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_20) .cse12))) (and (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse26) v_prenex_12)) (= v_DerPreprocessor_20 .cse26)))) (exists ((v_DerPreprocessor_19 Int)) (let ((.cse27 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_19) .cse12))) (and (= .cse27 v_DerPreprocessor_19) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse27))))))) .cse13) .cse28 (and .cse1 (or .cse29 (and .cse4 (or (and (exists ((v_DerPreprocessor_15 Int)) (let ((.cse30 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_15) .cse12))) (and (= .cse30 .cse11) (= .cse30 v_DerPreprocessor_15)))) .cse16) (and (or (exists ((v_arrayElimCell_113 Int) (v_prenex_10 Int)) (and (not (= v_arrayElimCell_113 .cse25)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_113) v_prenex_10)))) (exists ((v_DerPreprocessor_14 Int) (v_prenex_10 Int)) (let ((.cse31 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_14) .cse12))) (and (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse31) v_prenex_10)) (= v_DerPreprocessor_14 .cse31)))) (exists ((v_DerPreprocessor_13 Int)) (let ((.cse32 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_13) .cse12))) (and (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse32) (= .cse32 v_DerPreprocessor_13))))) .cse2))) (and (or (exists ((v_arrayElimCell_115 Int) (v_prenex_9 Int)) (and (not (= v_arrayElimCell_115 .cse25)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_115) v_prenex_9)))) (exists ((v_DerPreprocessor_16 Int) (v_prenex_9 Int)) (let ((.cse33 (select (select |c_#memory_$Pointer$#2.base| v_DerPreprocessor_16) .cse12))) (and (= v_DerPreprocessor_16 .cse33) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse33) v_prenex_9)))))) .cse13 .cse2)))) .cse0 .cse15 .cse8))))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse25)) (and .cse15 (or .cse34 (and .cse0 (or (and .cse1 (or .cse35 .cse36 (and .cse37 .cse2 .cse19))) (and .cse37 .cse2 .cse21) .cse38) .cse8))) (and .cse39 (or .cse34 (and (or .cse38 (and .cse1 (or .cse35 (and .cse37 .cse40 .cse2) .cse36)) (and .cse37 .cse41 .cse2)) .cse0 .cse8))) (and .cse42 (let ((.cse49 (or .cse50 .cse2))) (let ((.cse43 (and .cse49 .cse13)) (.cse48 (and .cse41 .cse2)) (.cse47 (and .cse40 .cse2)) (.cse44 (and .cse49 .cse4))) (or (and (or .cse43 .cse28 (and .cse1 (or .cse29 .cse44))) .cse0 .cse15 .cse8) (and (not (= .cse45 .cse25)) (let ((.cse46 (and .cse4 .cse2))) (or (and (or .cse43 (and .cse1 (or .cse29 .cse46)) .cse28) .cse0 .cse15 .cse8) (and .cse39 .cse0 (or .cse43 (and .cse1 (or .cse47 .cse46)) .cse48) .cse8)))) (and .cse39 .cse0 (or .cse43 .cse48 (and .cse1 (or .cse47 .cse44))) .cse8)))))))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1)) is different from true [2024-11-13 15:50:36,385 WARN L286 SmtUtils]: Spent 9.02s on a formula simplification. DAG size of input: 785 DAG size of output: 656 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 15:50:36,386 INFO L349 Elim1Store]: treesize reduction 456, result has 74.3 percent of original size [2024-11-13 15:50:36,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 24 new quantified variables, introduced 171 case distinctions, treesize of input 4882 treesize of output 4550