./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.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_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/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_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/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_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/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 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:48:23,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:48:23,494 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 12:48:23,505 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:48:23,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:48:23,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:48:23,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:48:23,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:48:23,551 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:48:23,551 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:48:23,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:48:23,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:48:23,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:48:23,554 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:48:23,555 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:48:23,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:48:23,555 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:48:23,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:48:23,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:48:23,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:48:23,556 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 12:48:23,556 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 12:48:23,557 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 12:48:23,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:48:23,557 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 12:48:23,557 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:48:23,557 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 12:48:23,557 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:48:23,557 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:48:23,558 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:48:23,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:48:23,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:48:23,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:48:23,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:48:23,559 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:48:23,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:48:23,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:48:23,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:48:23,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:48:23,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:48:23,560 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:48:23,560 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:48:23,560 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_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/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 -> 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 [2024-11-13 12:48:23,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:48:23,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:48:23,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:48:23,937 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:48:23,938 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:48:23,940 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i Unable to find full path for "g++" [2024-11-13 12:48:26,294 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:48:26,619 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:48:26,620 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2024-11-13 12:48:26,636 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/data/63cf59ac4/a9482ebe2ba84aeb830ff520b22371e2/FLAG11ab0c572 [2024-11-13 12:48:26,656 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/data/63cf59ac4/a9482ebe2ba84aeb830ff520b22371e2 [2024-11-13 12:48:26,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:48:26,662 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:48:26,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:48:26,664 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:48:26,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:48:26,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:48:26" (1/1) ... [2024-11-13 12:48:26,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aa4fe74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:26, skipping insertion in model container [2024-11-13 12:48:26,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:48:26" (1/1) ... [2024-11-13 12:48:26,712 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:48:27,188 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 12:48:27,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:48:27,222 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:48:27,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:48:27,362 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:48:27,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:27 WrapperNode [2024-11-13 12:48:27,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:48:27,364 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:48:27,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:48:27,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:48:27,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:27" (1/1) ... [2024-11-13 12:48:27,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:27" (1/1) ... [2024-11-13 12:48:27,423 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2024-11-13 12:48:27,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:48:27,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:48:27,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:48:27,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:48:27,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:27" (1/1) ... [2024-11-13 12:48:27,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:27" (1/1) ... [2024-11-13 12:48:27,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:27" (1/1) ... [2024-11-13 12:48:27,460 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 11, 8]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 8 writes are split as follows [0, 6, 2]. [2024-11-13 12:48:27,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:27" (1/1) ... [2024-11-13 12:48:27,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:27" (1/1) ... [2024-11-13 12:48:27,480 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:27" (1/1) ... [2024-11-13 12:48:27,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:27" (1/1) ... [2024-11-13 12:48:27,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:27" (1/1) ... [2024-11-13 12:48:27,489 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:27" (1/1) ... [2024-11-13 12:48:27,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:48:27,499 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:48:27,500 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:48:27,500 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:48:27,502 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:27" (1/1) ... [2024-11-13 12:48:27,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:48:27,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:48:27,545 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:48:27,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:48:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 12:48:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 12:48:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 12:48:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 12:48:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:48:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 12:48:27,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 12:48:27,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 12:48:27,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 12:48:27,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 12:48:27,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 12:48:27,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 12:48:27,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 12:48:27,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 12:48:27,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 12:48:27,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 12:48:27,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 12:48:27,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 12:48:27,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 12:48:27,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:48:27,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:48:27,746 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:48:27,749 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:48:28,351 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-13 12:48:28,352 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:48:28,374 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:48:28,374 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-13 12:48:28,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:48:28 BoogieIcfgContainer [2024-11-13 12:48:28,376 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:48:28,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:48:28,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:48:28,386 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:48:28,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:48:26" (1/3) ... [2024-11-13 12:48:28,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e064b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:48:28, skipping insertion in model container [2024-11-13 12:48:28,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:48:27" (2/3) ... [2024-11-13 12:48:28,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e064b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:48:28, skipping insertion in model container [2024-11-13 12:48:28,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:48:28" (3/3) ... [2024-11-13 12:48:28,390 INFO L112 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2024-11-13 12:48:28,409 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:48:28,411 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG optional_data_creation_test04-1.i that has 1 procedures, 101 locations, 1 initial locations, 3 loop locations, and 46 error locations. [2024-11-13 12:48:28,479 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:48:28,500 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;@68a4c90a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:48:28,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-13 12:48:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 54 states have (on average 2.037037037037037) internal successors, (110), 100 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:28,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 12:48:28,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:28,520 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 12:48:28,521 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:28,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:28,530 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2024-11-13 12:48:28,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:28,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786312123] [2024-11-13 12:48:28,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:28,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:29,001 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 12:48:29,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:29,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786312123] [2024-11-13 12:48:29,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786312123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:29,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:29,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:48:29,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620787577] [2024-11-13 12:48:29,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:29,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:48:29,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:29,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:48:29,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:48:29,057 INFO L87 Difference]: Start difference. First operand has 101 states, 54 states have (on average 2.037037037037037) internal successors, (110), 100 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:29,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:29,343 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2024-11-13 12:48:29,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:48:29,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-13 12:48:29,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:29,356 INFO L225 Difference]: With dead ends: 104 [2024-11-13 12:48:29,357 INFO L226 Difference]: Without dead ends: 102 [2024-11-13 12:48:29,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:48:29,366 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 117 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:29,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 94 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:48:29,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-13 12:48:29,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2024-11-13 12:48:29,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 95 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:29,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2024-11-13 12:48:29,408 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 4 [2024-11-13 12:48:29,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:29,409 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2024-11-13 12:48:29,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2024-11-13 12:48:29,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 12:48:29,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:29,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 12:48:29,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 12:48:29,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:29,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:29,411 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2024-11-13 12:48:29,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:29,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482116894] [2024-11-13 12:48:29,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:29,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:29,682 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 12:48:29,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:29,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482116894] [2024-11-13 12:48:29,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482116894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:29,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:29,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:48:29,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832790487] [2024-11-13 12:48:29,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:29,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:48:29,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:29,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:48:29,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:48:29,685 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:29,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:29,980 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2024-11-13 12:48:29,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:48:29,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-13 12:48:29,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:29,982 INFO L225 Difference]: With dead ends: 135 [2024-11-13 12:48:29,982 INFO L226 Difference]: Without dead ends: 135 [2024-11-13 12:48:29,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:48:29,984 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 114 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:29,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 98 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:48:29,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-13 12:48:29,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 105. [2024-11-13 12:48:29,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 66 states have (on average 1.7878787878787878) internal successors, (118), 104 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:29,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2024-11-13 12:48:29,994 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 4 [2024-11-13 12:48:29,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:29,994 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2024-11-13 12:48:29,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:29,995 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2024-11-13 12:48:29,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 12:48:29,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:29,995 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 12:48:29,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 12:48:29,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:29,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:29,996 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2024-11-13 12:48:29,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:29,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924209005] [2024-11-13 12:48:29,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:30,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:30,100 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 12:48:30,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:30,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924209005] [2024-11-13 12:48:30,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924209005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:30,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:30,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:48:30,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528622783] [2024-11-13 12:48:30,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:30,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:48:30,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:30,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:48:30,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:48:30,102 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:30,236 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2024-11-13 12:48:30,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:48:30,239 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-13 12:48:30,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:30,240 INFO L225 Difference]: With dead ends: 103 [2024-11-13 12:48:30,240 INFO L226 Difference]: Without dead ends: 103 [2024-11-13 12:48:30,240 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 12:48:30,241 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 30 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:30,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 111 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:48:30,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-13 12:48:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-13 12:48:30,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.7575757575757576) internal successors, (116), 102 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:30,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2024-11-13 12:48:30,259 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 5 [2024-11-13 12:48:30,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:30,259 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2024-11-13 12:48:30,260 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:30,260 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2024-11-13 12:48:30,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 12:48:30,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:30,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 12:48:30,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 12:48:30,261 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:30,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:30,261 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2024-11-13 12:48:30,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:30,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903869264] [2024-11-13 12:48:30,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:30,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:30,449 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 12:48:30,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:30,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903869264] [2024-11-13 12:48:30,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903869264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:30,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:30,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:48:30,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233788049] [2024-11-13 12:48:30,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:30,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:48:30,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:30,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:48:30,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:48:30,452 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:30,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:30,559 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2024-11-13 12:48:30,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:48:30,562 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-13 12:48:30,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:30,562 INFO L225 Difference]: With dead ends: 101 [2024-11-13 12:48:30,563 INFO L226 Difference]: Without dead ends: 101 [2024-11-13 12:48:30,563 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 12:48:30,564 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 30 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:30,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 116 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:48:30,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-13 12:48:30,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-13 12:48:30,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 66 states have (on average 1.7272727272727273) internal successors, (114), 100 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:30,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2024-11-13 12:48:30,582 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 5 [2024-11-13 12:48:30,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:30,582 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2024-11-13 12:48:30,582 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:30,582 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2024-11-13 12:48:30,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 12:48:30,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:30,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:30,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 12:48:30,583 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:30,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:30,584 INFO L85 PathProgramCache]: Analyzing trace with hash 234239181, now seen corresponding path program 1 times [2024-11-13 12:48:30,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:30,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815154569] [2024-11-13 12:48:30,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:30,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:30,756 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 12:48:30,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:30,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815154569] [2024-11-13 12:48:30,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815154569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:30,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:30,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:48:30,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692935616] [2024-11-13 12:48:30,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:30,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:48:30,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:30,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:48:30,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:48:30,758 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:30,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:30,866 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2024-11-13 12:48:30,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:48:30,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-13 12:48:30,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:30,868 INFO L225 Difference]: With dead ends: 97 [2024-11-13 12:48:30,868 INFO L226 Difference]: Without dead ends: 97 [2024-11-13 12:48:30,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:48:30,869 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 15 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:30,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 114 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:48:30,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-13 12:48:30,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-13 12:48:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 66 states have (on average 1.6666666666666667) internal successors, (110), 96 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:30,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2024-11-13 12:48:30,876 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 9 [2024-11-13 12:48:30,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:30,876 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2024-11-13 12:48:30,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:30,877 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2024-11-13 12:48:30,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 12:48:30,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:30,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:30,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 12:48:30,878 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:30,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:30,878 INFO L85 PathProgramCache]: Analyzing trace with hash 234239182, now seen corresponding path program 1 times [2024-11-13 12:48:30,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:30,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549299296] [2024-11-13 12:48:30,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:30,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:31,089 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 12:48:31,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:31,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549299296] [2024-11-13 12:48:31,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549299296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:31,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:31,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:48:31,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877053725] [2024-11-13 12:48:31,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:31,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:48:31,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:31,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:48:31,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:48:31,091 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:31,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:31,196 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2024-11-13 12:48:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:48:31,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-13 12:48:31,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:31,198 INFO L225 Difference]: With dead ends: 93 [2024-11-13 12:48:31,198 INFO L226 Difference]: Without dead ends: 93 [2024-11-13 12:48:31,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:48:31,199 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 30 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:31,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 118 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:48:31,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-13 12:48:31,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-13 12:48:31,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.606060606060606) internal successors, (106), 92 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:31,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2024-11-13 12:48:31,216 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 9 [2024-11-13 12:48:31,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:31,216 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2024-11-13 12:48:31,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:31,217 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2024-11-13 12:48:31,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 12:48:31,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:31,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:31,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 12:48:31,218 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:31,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:31,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1431747280, now seen corresponding path program 1 times [2024-11-13 12:48:31,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:31,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366062940] [2024-11-13 12:48:31,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:31,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:31,442 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 12:48:31,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:31,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366062940] [2024-11-13 12:48:31,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366062940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:31,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:31,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:48:31,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769284624] [2024-11-13 12:48:31,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:31,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:48:31,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:31,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:48:31,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:48:31,444 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:31,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:31,630 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2024-11-13 12:48:31,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:48:31,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-13 12:48:31,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:31,631 INFO L225 Difference]: With dead ends: 102 [2024-11-13 12:48:31,632 INFO L226 Difference]: Without dead ends: 102 [2024-11-13 12:48:31,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 12:48:31,633 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 6 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:31,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 217 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:48:31,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-13 12:48:31,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2024-11-13 12:48:31,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.6) internal successors, (112), 96 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:31,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2024-11-13 12:48:31,647 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 14 [2024-11-13 12:48:31,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:31,647 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2024-11-13 12:48:31,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:31,647 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2024-11-13 12:48:31,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 12:48:31,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:31,650 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:31,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 12:48:31,650 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:31,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:31,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1431747281, now seen corresponding path program 1 times [2024-11-13 12:48:31,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:31,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332027010] [2024-11-13 12:48:31,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:31,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:32,091 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 12:48:32,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:32,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332027010] [2024-11-13 12:48:32,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332027010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:32,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:32,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:48:32,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420809915] [2024-11-13 12:48:32,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:32,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:48:32,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:32,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:48:32,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:48:32,096 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:32,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:32,358 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2024-11-13 12:48:32,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:48:32,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-13 12:48:32,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:32,361 INFO L225 Difference]: With dead ends: 97 [2024-11-13 12:48:32,362 INFO L226 Difference]: Without dead ends: 97 [2024-11-13 12:48:32,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:48:32,363 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:32,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 270 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:48:32,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-13 12:48:32,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-13 12:48:32,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 96 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:32,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2024-11-13 12:48:32,376 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 14 [2024-11-13 12:48:32,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:32,376 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2024-11-13 12:48:32,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:32,377 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2024-11-13 12:48:32,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 12:48:32,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:32,378 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:32,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 12:48:32,378 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:32,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:32,380 INFO L85 PathProgramCache]: Analyzing trace with hash -79169355, now seen corresponding path program 1 times [2024-11-13 12:48:32,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:32,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404459167] [2024-11-13 12:48:32,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:32,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:32,617 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 12:48:32,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:32,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404459167] [2024-11-13 12:48:32,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404459167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:32,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:32,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:48:32,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372329340] [2024-11-13 12:48:32,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:32,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:48:32,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:32,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:48:32,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:48:32,623 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:32,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:32,769 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2024-11-13 12:48:32,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:48:32,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-13 12:48:32,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:32,771 INFO L225 Difference]: With dead ends: 157 [2024-11-13 12:48:32,771 INFO L226 Difference]: Without dead ends: 157 [2024-11-13 12:48:32,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:48:32,772 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 87 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:32,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 293 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:48:32,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-13 12:48:32,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 97. [2024-11-13 12:48:32,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 96 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:32,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2024-11-13 12:48:32,782 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 17 [2024-11-13 12:48:32,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:32,784 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2024-11-13 12:48:32,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:32,785 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2024-11-13 12:48:32,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 12:48:32,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:32,786 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:32,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 12:48:32,786 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:32,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:32,786 INFO L85 PathProgramCache]: Analyzing trace with hash -79169383, now seen corresponding path program 1 times [2024-11-13 12:48:32,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:32,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399049300] [2024-11-13 12:48:32,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:32,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:33,048 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 12:48:33,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:33,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399049300] [2024-11-13 12:48:33,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399049300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:33,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:33,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:48:33,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113437176] [2024-11-13 12:48:33,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:33,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:48:33,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:33,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:48:33,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:48:33,052 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:33,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:33,323 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2024-11-13 12:48:33,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:48:33,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-13 12:48:33,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:33,325 INFO L225 Difference]: With dead ends: 153 [2024-11-13 12:48:33,326 INFO L226 Difference]: Without dead ends: 153 [2024-11-13 12:48:33,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:48:33,327 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 95 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:33,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 200 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:48:33,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-13 12:48:33,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 97. [2024-11-13 12:48:33,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.542857142857143) internal successors, (108), 96 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:33,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2024-11-13 12:48:33,335 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 17 [2024-11-13 12:48:33,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:33,336 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2024-11-13 12:48:33,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:33,336 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2024-11-13 12:48:33,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 12:48:33,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:33,340 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:33,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 12:48:33,341 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:33,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:33,345 INFO L85 PathProgramCache]: Analyzing trace with hash -79169382, now seen corresponding path program 1 times [2024-11-13 12:48:33,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:33,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57804788] [2024-11-13 12:48:33,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:33,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:33,755 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 12:48:33,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:33,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57804788] [2024-11-13 12:48:33,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57804788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:33,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:33,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:48:33,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872287491] [2024-11-13 12:48:33,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:33,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:48:33,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:33,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:48:33,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:48:33,758 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:34,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:34,075 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2024-11-13 12:48:34,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:48:34,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-13 12:48:34,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:34,077 INFO L225 Difference]: With dead ends: 155 [2024-11-13 12:48:34,077 INFO L226 Difference]: Without dead ends: 155 [2024-11-13 12:48:34,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:48:34,078 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 78 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:34,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 217 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:48:34,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-13 12:48:34,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 97. [2024-11-13 12:48:34,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 96 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:34,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2024-11-13 12:48:34,085 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 17 [2024-11-13 12:48:34,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:34,085 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2024-11-13 12:48:34,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:34,085 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2024-11-13 12:48:34,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 12:48:34,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:34,086 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:34,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 12:48:34,087 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:34,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:34,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1499068093, now seen corresponding path program 1 times [2024-11-13 12:48:34,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:34,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494263201] [2024-11-13 12:48:34,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:34,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:34,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:48:34,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:34,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494263201] [2024-11-13 12:48:34,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494263201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:48:34,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938586054] [2024-11-13 12:48:34,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:34,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:48:34,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:48:34,429 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:48:34,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 12:48:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:34,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 12:48:34,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:48:34,651 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 12:48:34,678 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:48:34,679 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 12:48:34,715 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 19 treesize of output 1 [2024-11-13 12:48:34,802 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:48:34,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 12:48:34,840 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 31 treesize of output 13 [2024-11-13 12:48:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:48:34,855 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:48:34,908 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-13 12:48:34,908 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 21 treesize of output 20 [2024-11-13 12:48:34,967 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_207 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_207) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))))) is different from false [2024-11-13 12:48:34,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:48:34,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-13 12:48:35,001 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 12:48:35,010 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 7 treesize of output 3 [2024-11-13 12:48:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-13 12:48:35,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938586054] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:48:35,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:48:35,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-13 12:48:35,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153117640] [2024-11-13 12:48:35,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:48:35,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 12:48:35,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:35,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 12:48:35,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=122, Unknown=6, NotChecked=22, Total=182 [2024-11-13 12:48:35,036 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:35,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:35,420 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2024-11-13 12:48:35,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:48:35,421 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-13 12:48:35,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:35,422 INFO L225 Difference]: With dead ends: 99 [2024-11-13 12:48:35,422 INFO L226 Difference]: Without dead ends: 99 [2024-11-13 12:48:35,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=181, Unknown=6, NotChecked=28, Total=272 [2024-11-13 12:48:35,423 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 28 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:35,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 543 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 253 Invalid, 0 Unknown, 25 Unchecked, 0.3s Time] [2024-11-13 12:48:35,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-13 12:48:35,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2024-11-13 12:48:35,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 95 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2024-11-13 12:48:35,428 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 19 [2024-11-13 12:48:35,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:35,428 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2024-11-13 12:48:35,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:35,429 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2024-11-13 12:48:35,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 12:48:35,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:35,429 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:35,452 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 12:48:35,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-13 12:48:35,630 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:35,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:35,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1499068094, now seen corresponding path program 1 times [2024-11-13 12:48:35,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:35,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57142693] [2024-11-13 12:48:35,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:35,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:36,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:48:36,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:36,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57142693] [2024-11-13 12:48:36,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57142693] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:48:36,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549934925] [2024-11-13 12:48:36,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:36,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:48:36,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:48:36,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:48:36,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 12:48:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:36,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-13 12:48:36,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:48:36,420 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 12:48:36,441 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 12:48:36,455 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:48:36,456 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 12:48:36,479 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 19 treesize of output 1 [2024-11-13 12:48:36,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 12:48:36,642 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:48:36,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 12:48:36,658 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 30 treesize of output 13 [2024-11-13 12:48:36,756 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 31 treesize of output 13 [2024-11-13 12:48:36,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 12:48:36,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:48:36,801 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:48:36,943 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse0 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_266 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_266) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 4))) (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_266) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_265) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))))) is different from false [2024-11-13 12:48:37,060 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_266) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_265) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_266 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_266) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 4)))))) is different from false [2024-11-13 12:48:37,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:48:37,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-11-13 12:48:37,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:48:37,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-13 12:48:37,092 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 62 treesize of output 50 [2024-11-13 12:48:37,098 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 96 treesize of output 78 [2024-11-13 12:48:37,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-13 12:48:37,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 12:48:37,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:48:37,131 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2024-11-13 12:48:37,135 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:48:37,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-13 12:48:37,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-13 12:48:37,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549934925] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:48:37,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:48:37,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 20 [2024-11-13 12:48:37,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398573544] [2024-11-13 12:48:37,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:48:37,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 12:48:37,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:37,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 12:48:37,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=275, Unknown=7, NotChecked=70, Total=420 [2024-11-13 12:48:37,208 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 21 states, 20 states have (on average 2.0) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:38,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:38,005 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2024-11-13 12:48:38,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 12:48:38,006 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.0) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-13 12:48:38,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:38,007 INFO L225 Difference]: With dead ends: 106 [2024-11-13 12:48:38,007 INFO L226 Difference]: Without dead ends: 106 [2024-11-13 12:48:38,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=599, Unknown=7, NotChecked=106, Total=870 [2024-11-13 12:48:38,008 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 35 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 2 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:38,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 591 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 422 Invalid, 15 Unknown, 113 Unchecked, 0.5s Time] [2024-11-13 12:48:38,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-13 12:48:38,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-13 12:48:38,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 80 states have (on average 1.4625) internal successors, (117), 105 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2024-11-13 12:48:38,013 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 19 [2024-11-13 12:48:38,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:38,014 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2024-11-13 12:48:38,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.0) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:38,014 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2024-11-13 12:48:38,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 12:48:38,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:38,015 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:38,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 12:48:38,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-13 12:48:38,216 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:38,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:38,216 INFO L85 PathProgramCache]: Analyzing trace with hash -597981848, now seen corresponding path program 1 times [2024-11-13 12:48:38,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:38,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873272157] [2024-11-13 12:48:38,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:38,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:38,359 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 12:48:38,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:38,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873272157] [2024-11-13 12:48:38,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873272157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:38,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:38,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:48:38,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445474099] [2024-11-13 12:48:38,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:38,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:48:38,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:38,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:48:38,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:48:38,361 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:38,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:38,567 INFO L93 Difference]: Finished difference Result 169 states and 183 transitions. [2024-11-13 12:48:38,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:48:38,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-13 12:48:38,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:38,569 INFO L225 Difference]: With dead ends: 169 [2024-11-13 12:48:38,569 INFO L226 Difference]: Without dead ends: 169 [2024-11-13 12:48:38,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:48:38,570 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 70 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:38,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 229 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:48:38,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-13 12:48:38,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 106. [2024-11-13 12:48:38,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 80 states have (on average 1.45) internal successors, (116), 105 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:38,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2024-11-13 12:48:38,574 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 20 [2024-11-13 12:48:38,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:38,574 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2024-11-13 12:48:38,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:38,574 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2024-11-13 12:48:38,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 12:48:38,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:38,576 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:38,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 12:48:38,577 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:38,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:38,578 INFO L85 PathProgramCache]: Analyzing trace with hash -597981847, now seen corresponding path program 1 times [2024-11-13 12:48:38,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:38,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144251121] [2024-11-13 12:48:38,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:38,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:38,773 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 12:48:38,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:38,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144251121] [2024-11-13 12:48:38,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144251121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:38,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:38,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:48:38,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765097841] [2024-11-13 12:48:38,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:38,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:48:38,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:38,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:48:38,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:48:38,776 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:38,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:38,983 INFO L93 Difference]: Finished difference Result 168 states and 187 transitions. [2024-11-13 12:48:38,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:48:38,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-13 12:48:38,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:38,985 INFO L225 Difference]: With dead ends: 168 [2024-11-13 12:48:38,985 INFO L226 Difference]: Without dead ends: 168 [2024-11-13 12:48:38,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:48:38,986 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 51 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:38,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 218 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:48:38,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-13 12:48:38,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 122. [2024-11-13 12:48:38,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 121 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:38,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2024-11-13 12:48:38,992 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 20 [2024-11-13 12:48:38,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:38,993 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2024-11-13 12:48:38,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:38,994 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2024-11-13 12:48:38,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 12:48:38,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:38,994 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:38,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 12:48:38,995 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:38,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:38,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1047178718, now seen corresponding path program 1 times [2024-11-13 12:48:38,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:38,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076167227] [2024-11-13 12:48:38,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:38,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:39,353 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 12:48:39,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:39,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076167227] [2024-11-13 12:48:39,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076167227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:39,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:39,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 12:48:39,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872683114] [2024-11-13 12:48:39,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:39,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 12:48:39,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:39,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 12:48:39,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-13 12:48:39,355 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:39,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:39,608 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2024-11-13 12:48:39,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 12:48:39,608 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-13 12:48:39,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:39,609 INFO L225 Difference]: With dead ends: 149 [2024-11-13 12:48:39,609 INFO L226 Difference]: Without dead ends: 149 [2024-11-13 12:48:39,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:48:39,610 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 35 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:39,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 439 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:48:39,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-13 12:48:39,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 137. [2024-11-13 12:48:39,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 111 states have (on average 1.3423423423423424) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:39,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2024-11-13 12:48:39,615 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 23 [2024-11-13 12:48:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:39,615 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2024-11-13 12:48:39,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2024-11-13 12:48:39,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 12:48:39,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:39,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:39,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 12:48:39,616 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:39,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:39,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1316368411, now seen corresponding path program 1 times [2024-11-13 12:48:39,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:39,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744975601] [2024-11-13 12:48:39,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:39,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:39,732 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 12:48:39,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:39,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744975601] [2024-11-13 12:48:39,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744975601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:39,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:39,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:48:39,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140300983] [2024-11-13 12:48:39,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:39,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:48:39,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:39,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:48:39,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:48:39,734 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:39,815 INFO L93 Difference]: Finished difference Result 165 states and 181 transitions. [2024-11-13 12:48:39,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:48:39,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-13 12:48:39,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:39,817 INFO L225 Difference]: With dead ends: 165 [2024-11-13 12:48:39,817 INFO L226 Difference]: Without dead ends: 165 [2024-11-13 12:48:39,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:48:39,818 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:39,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 225 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:48:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-13 12:48:39,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 149. [2024-11-13 12:48:39,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 123 states have (on average 1.4146341463414633) internal successors, (174), 148 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:39,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 174 transitions. [2024-11-13 12:48:39,824 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 174 transitions. Word has length 25 [2024-11-13 12:48:39,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:39,824 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 174 transitions. [2024-11-13 12:48:39,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:39,824 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 174 transitions. [2024-11-13 12:48:39,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 12:48:39,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:39,825 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:39,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 12:48:39,825 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:39,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:39,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2142252052, now seen corresponding path program 1 times [2024-11-13 12:48:39,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:39,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942978675] [2024-11-13 12:48:39,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:39,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:39,974 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 12:48:39,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:39,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942978675] [2024-11-13 12:48:39,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942978675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:39,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:39,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:48:39,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012625125] [2024-11-13 12:48:39,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:39,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:48:39,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:39,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:48:39,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:48:39,977 INFO L87 Difference]: Start difference. First operand 149 states and 174 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:40,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:40,129 INFO L93 Difference]: Finished difference Result 212 states and 232 transitions. [2024-11-13 12:48:40,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:48:40,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-13 12:48:40,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:40,131 INFO L225 Difference]: With dead ends: 212 [2024-11-13 12:48:40,131 INFO L226 Difference]: Without dead ends: 212 [2024-11-13 12:48:40,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:48:40,132 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 71 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:40,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 250 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:48:40,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-13 12:48:40,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 150. [2024-11-13 12:48:40,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 124 states have (on average 1.4112903225806452) internal successors, (175), 149 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:40,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 175 transitions. [2024-11-13 12:48:40,137 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 175 transitions. Word has length 26 [2024-11-13 12:48:40,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:40,137 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 175 transitions. [2024-11-13 12:48:40,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:40,138 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 175 transitions. [2024-11-13 12:48:40,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 12:48:40,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:40,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:40,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 12:48:40,138 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:40,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:40,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1985304003, now seen corresponding path program 1 times [2024-11-13 12:48:40,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:40,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761392277] [2024-11-13 12:48:40,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:40,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:40,285 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 12:48:40,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:40,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761392277] [2024-11-13 12:48:40,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761392277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:40,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:40,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:48:40,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206050376] [2024-11-13 12:48:40,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:40,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:48:40,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:40,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:48:40,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:48:40,287 INFO L87 Difference]: Start difference. First operand 150 states and 175 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:40,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:40,476 INFO L93 Difference]: Finished difference Result 215 states and 236 transitions. [2024-11-13 12:48:40,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:48:40,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-13 12:48:40,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:40,478 INFO L225 Difference]: With dead ends: 215 [2024-11-13 12:48:40,478 INFO L226 Difference]: Without dead ends: 215 [2024-11-13 12:48:40,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:48:40,479 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 79 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:40,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 207 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:48:40,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-13 12:48:40,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 153. [2024-11-13 12:48:40,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 127 states have (on average 1.4015748031496063) internal successors, (178), 152 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:40,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 178 transitions. [2024-11-13 12:48:40,489 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 178 transitions. Word has length 27 [2024-11-13 12:48:40,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:40,489 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 178 transitions. [2024-11-13 12:48:40,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:40,489 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 178 transitions. [2024-11-13 12:48:40,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 12:48:40,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:40,490 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:40,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 12:48:40,490 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:40,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:40,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1414881777, now seen corresponding path program 1 times [2024-11-13 12:48:40,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:40,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856205508] [2024-11-13 12:48:40,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:40,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:40,782 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 12:48:40,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:40,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856205508] [2024-11-13 12:48:40,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856205508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:40,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:40,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 12:48:40,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062174137] [2024-11-13 12:48:40,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:40,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:48:40,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:40,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:48:40,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:48:40,786 INFO L87 Difference]: Start difference. First operand 153 states and 178 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:40,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:40,982 INFO L93 Difference]: Finished difference Result 174 states and 192 transitions. [2024-11-13 12:48:40,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:48:40,982 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-13 12:48:40,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:40,983 INFO L225 Difference]: With dead ends: 174 [2024-11-13 12:48:40,983 INFO L226 Difference]: Without dead ends: 174 [2024-11-13 12:48:40,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-13 12:48:40,984 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 154 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:40,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 152 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:48:40,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-13 12:48:40,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 154. [2024-11-13 12:48:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 128 states have (on average 1.40625) internal successors, (180), 153 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 180 transitions. [2024-11-13 12:48:40,997 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 180 transitions. Word has length 28 [2024-11-13 12:48:40,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:40,997 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 180 transitions. [2024-11-13 12:48:40,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:40,997 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 180 transitions. [2024-11-13 12:48:40,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 12:48:40,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:40,998 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:40,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 12:48:40,998 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:40,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:40,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1414881776, now seen corresponding path program 1 times [2024-11-13 12:48:40,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:40,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242616674] [2024-11-13 12:48:40,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:40,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:41,067 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 12:48:41,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:41,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242616674] [2024-11-13 12:48:41,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242616674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:41,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:41,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:48:41,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435299720] [2024-11-13 12:48:41,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:41,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:48:41,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:41,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:48:41,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:48:41,070 INFO L87 Difference]: Start difference. First operand 154 states and 180 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:41,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:41,135 INFO L93 Difference]: Finished difference Result 149 states and 172 transitions. [2024-11-13 12:48:41,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:48:41,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-13 12:48:41,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:41,136 INFO L225 Difference]: With dead ends: 149 [2024-11-13 12:48:41,136 INFO L226 Difference]: Without dead ends: 149 [2024-11-13 12:48:41,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:48:41,137 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 59 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:41,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 54 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:48:41,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-13 12:48:41,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-13 12:48:41,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 128 states have (on average 1.34375) internal successors, (172), 148 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:41,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2024-11-13 12:48:41,143 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 28 [2024-11-13 12:48:41,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:41,143 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2024-11-13 12:48:41,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:41,144 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2024-11-13 12:48:41,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 12:48:41,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:41,144 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:41,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 12:48:41,145 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:41,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:41,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1201017024, now seen corresponding path program 1 times [2024-11-13 12:48:41,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:41,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580937485] [2024-11-13 12:48:41,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:41,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:41,533 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 12:48:41,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:41,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580937485] [2024-11-13 12:48:41,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580937485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:41,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:41,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 12:48:41,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214303766] [2024-11-13 12:48:41,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:41,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 12:48:41,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:41,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 12:48:41,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:48:41,535 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:41,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:41,923 INFO L93 Difference]: Finished difference Result 171 states and 187 transitions. [2024-11-13 12:48:41,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:48:41,923 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-13 12:48:41,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:41,924 INFO L225 Difference]: With dead ends: 171 [2024-11-13 12:48:41,924 INFO L226 Difference]: Without dead ends: 171 [2024-11-13 12:48:41,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-13 12:48:41,926 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 76 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:41,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 343 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:48:41,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-13 12:48:41,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 154. [2024-11-13 12:48:41,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 134 states have (on average 1.335820895522388) internal successors, (179), 153 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:41,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 179 transitions. [2024-11-13 12:48:41,931 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 179 transitions. Word has length 28 [2024-11-13 12:48:41,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:41,931 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 179 transitions. [2024-11-13 12:48:41,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:41,932 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 179 transitions. [2024-11-13 12:48:41,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 12:48:41,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:41,932 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:41,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 12:48:41,932 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:41,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:41,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1201017023, now seen corresponding path program 1 times [2024-11-13 12:48:41,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:41,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961626844] [2024-11-13 12:48:41,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:41,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:42,436 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 12:48:42,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:42,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961626844] [2024-11-13 12:48:42,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961626844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:42,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:42,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 12:48:42,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540421209] [2024-11-13 12:48:42,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:42,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 12:48:42,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:42,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 12:48:42,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:48:42,438 INFO L87 Difference]: Start difference. First operand 154 states and 179 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:42,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:42,885 INFO L93 Difference]: Finished difference Result 189 states and 219 transitions. [2024-11-13 12:48:42,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 12:48:42,886 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-13 12:48:42,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:42,887 INFO L225 Difference]: With dead ends: 189 [2024-11-13 12:48:42,887 INFO L226 Difference]: Without dead ends: 189 [2024-11-13 12:48:42,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-13 12:48:42,889 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 56 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:42,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 486 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:48:42,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-13 12:48:42,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 164. [2024-11-13 12:48:42,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 144 states have (on average 1.3472222222222223) internal successors, (194), 163 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 194 transitions. [2024-11-13 12:48:42,896 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 194 transitions. Word has length 28 [2024-11-13 12:48:42,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:42,897 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 194 transitions. [2024-11-13 12:48:42,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:42,897 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 194 transitions. [2024-11-13 12:48:42,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 12:48:42,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:42,898 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:42,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 12:48:42,898 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:42,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:42,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1254039198, now seen corresponding path program 2 times [2024-11-13 12:48:42,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:42,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008064797] [2024-11-13 12:48:42,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:42,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:48:43,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:43,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008064797] [2024-11-13 12:48:43,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008064797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:48:43,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188646073] [2024-11-13 12:48:43,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:48:43,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:48:43,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:48:43,809 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:48:43,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 12:48:43,984 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:48:43,984 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:48:43,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-13 12:48:43,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:48:43,995 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 12:48:44,009 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 12:48:44,024 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:48:44,025 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 12:48:44,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 12:48:44,088 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 19 treesize of output 1 [2024-11-13 12:48:44,292 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:48:44,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 12:48:44,306 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 30 treesize of output 13 [2024-11-13 12:48:44,493 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:48:44,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 12:48:44,503 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 30 treesize of output 13 [2024-11-13 12:48:44,699 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 12:48:44,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 12:48:44,716 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 30 treesize of output 13 [2024-11-13 12:48:44,813 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 31 treesize of output 13 [2024-11-13 12:48:44,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 12:48:44,870 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:48:44,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:48:45,057 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_602) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_603) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_602 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_602) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 4))))) is different from false [2024-11-13 12:48:45,327 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse0 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_602 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_601) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_600) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) v_ArrVal_602) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 8))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_600))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_601) .cse2 v_ArrVal_602) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_603) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))))))) is different from false [2024-11-13 12:48:45,373 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_602 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_601) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_600) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_602) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_600))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_601) .cse3 v_ArrVal_602) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_603) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))))) is different from false [2024-11-13 12:48:45,417 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_602 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_601) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_600) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_602) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_600))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ .cse0 16 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_601) .cse3 v_ArrVal_602) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_603) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))))) is different from false [2024-11-13 12:48:45,452 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4)) (.cse3 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_599))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse4 (store .cse5 .cse0 v_ArrVal_600))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_598) .cse0 v_ArrVal_601) .cse1 v_ArrVal_602) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 16) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_603) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_599))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_598) .cse6 v_ArrVal_601) (select (select (store .cse7 .cse6 v_ArrVal_600) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_602))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 12))))) is different from false [2024-11-13 12:48:45,515 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse4 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_599))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_598) .cse1 v_ArrVal_601) (select (select (store .cse2 .cse1 v_ArrVal_600) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_602))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse4 12))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_599))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_600))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_598) .cse5 v_ArrVal_601) .cse6 v_ArrVal_602) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse4 16) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_603) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))))))) is different from false [2024-11-13 12:48:45,561 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_599))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_598) .cse1 v_ArrVal_601) (select (select (store .cse2 .cse1 v_ArrVal_600) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_602))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 12))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_599))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_600))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_598) .cse4 v_ArrVal_601) .cse5 v_ArrVal_602) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 16) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_603) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))))))) is different from false [2024-11-13 12:48:45,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:48:45,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178 [2024-11-13 12:48:45,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:48:45,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 108 [2024-11-13 12:48:45,608 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 18180 treesize of output 15402 [2024-11-13 12:48:45,858 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 4329 treesize of output 4215 [2024-11-13 12:48:45,889 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 236 treesize of output 200 [2024-11-13 12:48:45,896 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 200 treesize of output 184 [2024-11-13 12:48:45,906 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 158 treesize of output 154 [2024-11-13 12:48:45,912 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 180 treesize of output 148 [2024-11-13 12:48:45,922 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 126 treesize of output 122 [2024-11-13 12:48:45,929 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 144 treesize of output 132 [2024-11-13 12:48:45,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:48:45,996 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 91 [2024-11-13 12:48:46,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:48:46,008 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 61 [2024-11-13 12:48:46,012 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:48:46,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 55 [2024-11-13 12:48:46,022 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:48:46,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-13 12:48:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 24 not checked. [2024-11-13 12:48:46,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188646073] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:48:46,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:48:46,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 15] total 37 [2024-11-13 12:48:46,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818639185] [2024-11-13 12:48:46,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:48:46,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-13 12:48:46,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:46,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-13 12:48:46,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=765, Unknown=29, NotChecked=448, Total=1406 [2024-11-13 12:48:46,128 INFO L87 Difference]: Start difference. First operand 164 states and 194 transitions. Second operand has 38 states, 37 states have (on average 2.0) internal successors, (74), 38 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:48,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:48,046 INFO L93 Difference]: Finished difference Result 174 states and 204 transitions. [2024-11-13 12:48:48,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 12:48:48,047 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.0) internal successors, (74), 38 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-13 12:48:48,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:48,048 INFO L225 Difference]: With dead ends: 174 [2024-11-13 12:48:48,048 INFO L226 Difference]: Without dead ends: 174 [2024-11-13 12:48:48,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=336, Invalid=1549, Unknown=35, NotChecked=630, Total=2550 [2024-11-13 12:48:48,050 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 57 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 5 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 430 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:48,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 979 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 672 Invalid, 27 Unknown, 430 Unchecked, 0.9s Time] [2024-11-13 12:48:48,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-13 12:48:48,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-11-13 12:48:48,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 154 states have (on average 1.3246753246753247) internal successors, (204), 173 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:48,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 204 transitions. [2024-11-13 12:48:48,056 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 204 transitions. Word has length 29 [2024-11-13 12:48:48,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:48,057 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 204 transitions. [2024-11-13 12:48:48,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.0) internal successors, (74), 38 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:48,057 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 204 transitions. [2024-11-13 12:48:48,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 12:48:48,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:48,058 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:48,082 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 12:48:48,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-13 12:48:48,258 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:48,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:48,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1874471451, now seen corresponding path program 1 times [2024-11-13 12:48:48,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:48,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613897432] [2024-11-13 12:48:48,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:48,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:48,689 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 12:48:48,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:48,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613897432] [2024-11-13 12:48:48,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613897432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:48,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:48,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 12:48:48,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142721050] [2024-11-13 12:48:48,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:48,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 12:48:48,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:48,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 12:48:48,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:48:48,692 INFO L87 Difference]: Start difference. First operand 174 states and 204 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:49,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:49,083 INFO L93 Difference]: Finished difference Result 194 states and 215 transitions. [2024-11-13 12:48:49,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:48:49,084 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-13 12:48:49,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:49,085 INFO L225 Difference]: With dead ends: 194 [2024-11-13 12:48:49,085 INFO L226 Difference]: Without dead ends: 194 [2024-11-13 12:48:49,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-13 12:48:49,086 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 68 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:49,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 374 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:48:49,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-13 12:48:49,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 174. [2024-11-13 12:48:49,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 154 states have (on average 1.3116883116883118) internal successors, (202), 173 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:49,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 202 transitions. [2024-11-13 12:48:49,092 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 202 transitions. Word has length 31 [2024-11-13 12:48:49,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:49,092 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 202 transitions. [2024-11-13 12:48:49,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:49,093 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 202 transitions. [2024-11-13 12:48:49,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 12:48:49,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:49,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:49,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 12:48:49,094 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:49,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:49,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1874460466, now seen corresponding path program 1 times [2024-11-13 12:48:49,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:49,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970136056] [2024-11-13 12:48:49,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:49,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:49,183 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 12:48:49,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:49,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970136056] [2024-11-13 12:48:49,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970136056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:49,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:49,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:48:49,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976238495] [2024-11-13 12:48:49,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:49,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:48:49,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:49,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:48:49,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:48:49,186 INFO L87 Difference]: Start difference. First operand 174 states and 202 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:49,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:49,277 INFO L93 Difference]: Finished difference Result 173 states and 199 transitions. [2024-11-13 12:48:49,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:48:49,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-13 12:48:49,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:49,279 INFO L225 Difference]: With dead ends: 173 [2024-11-13 12:48:49,279 INFO L226 Difference]: Without dead ends: 173 [2024-11-13 12:48:49,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 12:48:49,280 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 6 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:49,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 241 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:48:49,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-13 12:48:49,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-11-13 12:48:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 154 states have (on average 1.2922077922077921) internal successors, (199), 172 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:49,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 199 transitions. [2024-11-13 12:48:49,286 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 199 transitions. Word has length 31 [2024-11-13 12:48:49,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:49,287 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 199 transitions. [2024-11-13 12:48:49,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:49,287 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 199 transitions. [2024-11-13 12:48:49,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 12:48:49,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:49,288 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:49,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 12:48:49,288 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:49,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:49,289 INFO L85 PathProgramCache]: Analyzing trace with hash -2021267551, now seen corresponding path program 1 times [2024-11-13 12:48:49,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:49,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286787683] [2024-11-13 12:48:49,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:49,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:48:49,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:49,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286787683] [2024-11-13 12:48:49,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286787683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:49,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:49,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:48:49,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173649024] [2024-11-13 12:48:49,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:49,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:48:49,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:49,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:48:49,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:48:49,433 INFO L87 Difference]: Start difference. First operand 173 states and 199 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:49,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:49,563 INFO L93 Difference]: Finished difference Result 171 states and 193 transitions. [2024-11-13 12:48:49,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:48:49,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-13 12:48:49,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:49,564 INFO L225 Difference]: With dead ends: 171 [2024-11-13 12:48:49,564 INFO L226 Difference]: Without dead ends: 171 [2024-11-13 12:48:49,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:48:49,565 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 48 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:49,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 201 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:48:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-13 12:48:49,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-13 12:48:49,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 154 states have (on average 1.2532467532467533) internal successors, (193), 170 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 193 transitions. [2024-11-13 12:48:49,570 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 193 transitions. Word has length 32 [2024-11-13 12:48:49,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:49,571 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 193 transitions. [2024-11-13 12:48:49,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:49,571 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 193 transitions. [2024-11-13 12:48:49,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 12:48:49,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:49,572 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:49,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 12:48:49,572 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:49,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:49,572 INFO L85 PathProgramCache]: Analyzing trace with hash -869279064, now seen corresponding path program 1 times [2024-11-13 12:48:49,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:49,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998298831] [2024-11-13 12:48:49,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:49,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:50,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:48:50,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:50,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998298831] [2024-11-13 12:48:50,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998298831] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:48:50,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753739896] [2024-11-13 12:48:50,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:50,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:48:50,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:48:50,154 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:48:50,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 12:48:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:50,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 12:48:50,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:48:50,694 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-13 12:48:50,695 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 23 treesize of output 15 [2024-11-13 12:48:51,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:48:51,407 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 95 treesize of output 67 [2024-11-13 12:48:51,417 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 13 [2024-11-13 12:48:51,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:48:51,930 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:48:52,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 12:48:52,437 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_append_~node~0#1.base_13| Int) (v_ArrVal_773 Int) (|ULTIMATE.start_append_~pointerToList#1.offset| Int)) (let ((.cse0 (select (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset| |v_ULTIMATE.start_append_~node~0#1.base_13|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (= (store (store (store |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_13| v_ArrVal_773) .cse0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (= .cse0 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_13|) 0))))) is different from false [2024-11-13 12:48:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:48:52,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753739896] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:48:52,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:48:52,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 24 [2024-11-13 12:48:52,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415124129] [2024-11-13 12:48:52,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:48:52,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-13 12:48:52,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:52,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-13 12:48:52,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=474, Unknown=5, NotChecked=44, Total=600 [2024-11-13 12:48:52,449 INFO L87 Difference]: Start difference. First operand 171 states and 193 transitions. Second operand has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 25 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:54,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:54,615 INFO L93 Difference]: Finished difference Result 245 states and 272 transitions. [2024-11-13 12:48:54,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:48:54,615 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 25 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-13 12:48:54,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:54,617 INFO L225 Difference]: With dead ends: 245 [2024-11-13 12:48:54,617 INFO L226 Difference]: Without dead ends: 243 [2024-11-13 12:48:54,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=151, Invalid=778, Unknown=5, NotChecked=58, Total=992 [2024-11-13 12:48:54,618 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 63 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 7 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:54,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 773 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 703 Invalid, 7 Unknown, 113 Unchecked, 1.4s Time] [2024-11-13 12:48:54,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-13 12:48:54,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 200. [2024-11-13 12:48:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 183 states have (on average 1.2240437158469946) internal successors, (224), 199 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:54,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 224 transitions. [2024-11-13 12:48:54,632 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 224 transitions. Word has length 33 [2024-11-13 12:48:54,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:54,632 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 224 transitions. [2024-11-13 12:48:54,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 25 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:54,632 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 224 transitions. [2024-11-13 12:48:54,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 12:48:54,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:54,633 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:54,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-13 12:48:54,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-13 12:48:54,833 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:54,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:54,835 INFO L85 PathProgramCache]: Analyzing trace with hash -869279092, now seen corresponding path program 1 times [2024-11-13 12:48:54,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:54,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143932929] [2024-11-13 12:48:54,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:54,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:48:55,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:55,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143932929] [2024-11-13 12:48:55,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143932929] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:48:55,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454121077] [2024-11-13 12:48:55,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:55,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:48:55,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:48:55,895 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:48:55,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 12:48:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:56,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-13 12:48:56,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:48:56,203 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:48:56,204 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 12:48:56,284 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 15 treesize of output 11 [2024-11-13 12:48:56,295 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 12:48:56,479 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 12:48:56,498 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 27 treesize of output 15 [2024-11-13 12:48:56,600 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:48:56,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2024-11-13 12:48:56,858 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:48:56,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:48:56,868 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 29 treesize of output 19 [2024-11-13 12:48:56,889 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-11-13 12:48:56,890 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 29 treesize of output 19 [2024-11-13 12:48:57,239 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 12:48:57,245 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 19 treesize of output 11 [2024-11-13 12:48:57,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:48:57,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:48:57,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 12:48:57,925 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 154 treesize of output 138 [2024-11-13 12:48:57,952 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 56 treesize of output 40 [2024-11-13 12:48:58,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:48:58,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454121077] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:48:58,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:48:58,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 32 [2024-11-13 12:48:58,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734491768] [2024-11-13 12:48:58,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:48:58,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-13 12:48:58,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:58,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-13 12:48:58,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2024-11-13 12:48:58,224 INFO L87 Difference]: Start difference. First operand 200 states and 224 transitions. Second operand has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:59,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:59,249 INFO L93 Difference]: Finished difference Result 252 states and 278 transitions. [2024-11-13 12:48:59,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 12:48:59,250 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-13 12:48:59,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:59,251 INFO L225 Difference]: With dead ends: 252 [2024-11-13 12:48:59,251 INFO L226 Difference]: Without dead ends: 234 [2024-11-13 12:48:59,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=189, Invalid=1451, Unknown=0, NotChecked=0, Total=1640 [2024-11-13 12:48:59,253 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 200 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:59,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1002 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 12:48:59,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-13 12:48:59,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 182. [2024-11-13 12:48:59,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 165 states have (on average 1.2424242424242424) internal successors, (205), 181 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:59,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 205 transitions. [2024-11-13 12:48:59,260 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 205 transitions. Word has length 33 [2024-11-13 12:48:59,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:59,261 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 205 transitions. [2024-11-13 12:48:59,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 205 transitions. [2024-11-13 12:48:59,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 12:48:59,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:59,263 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:59,289 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 12:48:59,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-13 12:48:59,468 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:48:59,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:59,468 INFO L85 PathProgramCache]: Analyzing trace with hash -785628890, now seen corresponding path program 1 times [2024-11-13 12:48:59,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:59,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861875799] [2024-11-13 12:48:59,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:59,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:00,037 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 12:49:00,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:49:00,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861875799] [2024-11-13 12:49:00,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861875799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:49:00,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:49:00,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 12:49:00,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484056645] [2024-11-13 12:49:00,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:49:00,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 12:49:00,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:49:00,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 12:49:00,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-13 12:49:00,040 INFO L87 Difference]: Start difference. First operand 182 states and 205 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:49:00,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:49:00,588 INFO L93 Difference]: Finished difference Result 202 states and 219 transitions. [2024-11-13 12:49:00,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:49:00,589 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-13 12:49:00,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:49:00,590 INFO L225 Difference]: With dead ends: 202 [2024-11-13 12:49:00,590 INFO L226 Difference]: Without dead ends: 202 [2024-11-13 12:49:00,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2024-11-13 12:49:00,591 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 113 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:49:00,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 326 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:49:00,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-13 12:49:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 184. [2024-11-13 12:49:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 167 states have (on average 1.2395209580838322) internal successors, (207), 183 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:49:00,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 207 transitions. [2024-11-13 12:49:00,598 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 207 transitions. Word has length 34 [2024-11-13 12:49:00,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:49:00,599 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 207 transitions. [2024-11-13 12:49:00,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:49:00,599 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 207 transitions. [2024-11-13 12:49:00,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 12:49:00,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:49:00,600 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:49:00,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 12:49:00,601 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:49:00,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:49:00,601 INFO L85 PathProgramCache]: Analyzing trace with hash -44220408, now seen corresponding path program 1 times [2024-11-13 12:49:00,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:49:00,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507263724] [2024-11-13 12:49:00,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:00,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:49:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:01,231 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 12:49:01,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:49:01,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507263724] [2024-11-13 12:49:01,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507263724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:49:01,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:49:01,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 12:49:01,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038203931] [2024-11-13 12:49:01,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:49:01,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 12:49:01,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:49:01,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 12:49:01,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-13 12:49:01,234 INFO L87 Difference]: Start difference. First operand 184 states and 207 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:49:01,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:49:01,913 INFO L93 Difference]: Finished difference Result 193 states and 207 transitions. [2024-11-13 12:49:01,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:49:01,914 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-13 12:49:01,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:49:01,915 INFO L225 Difference]: With dead ends: 193 [2024-11-13 12:49:01,915 INFO L226 Difference]: Without dead ends: 193 [2024-11-13 12:49:01,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2024-11-13 12:49:01,916 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 63 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:49:01,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 349 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 12:49:01,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-13 12:49:01,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 184. [2024-11-13 12:49:01,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 167 states have (on average 1.221556886227545) internal successors, (204), 183 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:49:01,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 204 transitions. [2024-11-13 12:49:01,922 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 204 transitions. Word has length 36 [2024-11-13 12:49:01,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:49:01,923 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 204 transitions. [2024-11-13 12:49:01,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:49:01,923 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 204 transitions. [2024-11-13 12:49:01,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 12:49:01,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:49:01,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:49:01,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-13 12:49:01,924 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:49:01,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:49:01,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1393361757, now seen corresponding path program 1 times [2024-11-13 12:49:01,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:49:01,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629271799] [2024-11-13 12:49:01,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:01,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:49:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:02,510 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 12:49:02,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:49:02,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629271799] [2024-11-13 12:49:02,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629271799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:49:02,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:49:02,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 12:49:02,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761131284] [2024-11-13 12:49:02,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:49:02,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 12:49:02,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:49:02,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 12:49:02,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:49:02,512 INFO L87 Difference]: Start difference. First operand 184 states and 204 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:49:03,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:49:03,408 INFO L93 Difference]: Finished difference Result 243 states and 262 transitions. [2024-11-13 12:49:03,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 12:49:03,409 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-13 12:49:03,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:49:03,410 INFO L225 Difference]: With dead ends: 243 [2024-11-13 12:49:03,410 INFO L226 Difference]: Without dead ends: 243 [2024-11-13 12:49:03,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2024-11-13 12:49:03,412 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 110 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:49:03,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 504 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 12:49:03,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-13 12:49:03,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 187. [2024-11-13 12:49:03,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 170 states have (on average 1.2176470588235293) internal successors, (207), 186 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:49:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 207 transitions. [2024-11-13 12:49:03,423 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 207 transitions. Word has length 37 [2024-11-13 12:49:03,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:49:03,424 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 207 transitions. [2024-11-13 12:49:03,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:49:03,424 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 207 transitions. [2024-11-13 12:49:03,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 12:49:03,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:49:03,425 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:49:03,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-13 12:49:03,425 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:49:03,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:49:03,427 INFO L85 PathProgramCache]: Analyzing trace with hash -244541335, now seen corresponding path program 1 times [2024-11-13 12:49:03,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:49:03,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544157998] [2024-11-13 12:49:03,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:03,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:49:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:03,667 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 12:49:03,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:49:03,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544157998] [2024-11-13 12:49:03,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544157998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:49:03,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:49:03,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:49:03,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224292422] [2024-11-13 12:49:03,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:49:03,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:49:03,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:49:03,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:49:03,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:49:03,670 INFO L87 Difference]: Start difference. First operand 187 states and 207 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:49:03,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:49:03,878 INFO L93 Difference]: Finished difference Result 197 states and 210 transitions. [2024-11-13 12:49:03,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:49:03,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-13 12:49:03,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:49:03,880 INFO L225 Difference]: With dead ends: 197 [2024-11-13 12:49:03,880 INFO L226 Difference]: Without dead ends: 197 [2024-11-13 12:49:03,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-13 12:49:03,881 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 137 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:49:03,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 159 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:49:03,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-13 12:49:03,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 183. [2024-11-13 12:49:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 166 states have (on average 1.2289156626506024) internal successors, (204), 182 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:49:03,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 204 transitions. [2024-11-13 12:49:03,887 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 204 transitions. Word has length 38 [2024-11-13 12:49:03,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:49:03,887 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 204 transitions. [2024-11-13 12:49:03,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:49:03,888 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 204 transitions. [2024-11-13 12:49:03,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 12:49:03,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:49:03,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:49:03,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 12:49:03,889 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:49:03,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:49:03,889 INFO L85 PathProgramCache]: Analyzing trace with hash 453865995, now seen corresponding path program 1 times [2024-11-13 12:49:03,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:49:03,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358763714] [2024-11-13 12:49:03,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:03,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:49:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:04,638 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 12:49:04,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:49:04,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358763714] [2024-11-13 12:49:04,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358763714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:49:04,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:49:04,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 12:49:04,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573925644] [2024-11-13 12:49:04,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:49:04,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 12:49:04,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:49:04,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 12:49:04,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-11-13 12:49:04,641 INFO L87 Difference]: Start difference. First operand 183 states and 204 transitions. Second operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:49:05,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:49:05,371 INFO L93 Difference]: Finished difference Result 190 states and 203 transitions. [2024-11-13 12:49:05,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 12:49:05,372 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-13 12:49:05,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:49:05,373 INFO L225 Difference]: With dead ends: 190 [2024-11-13 12:49:05,373 INFO L226 Difference]: Without dead ends: 190 [2024-11-13 12:49:05,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2024-11-13 12:49:05,374 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 182 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:49:05,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 262 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:49:05,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-13 12:49:05,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 183. [2024-11-13 12:49:05,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 166 states have (on average 1.2228915662650603) internal successors, (203), 182 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:49:05,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 203 transitions. [2024-11-13 12:49:05,381 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 203 transitions. Word has length 38 [2024-11-13 12:49:05,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:49:05,381 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 203 transitions. [2024-11-13 12:49:05,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:49:05,381 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 203 transitions. [2024-11-13 12:49:05,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 12:49:05,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:49:05,382 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:49:05,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-13 12:49:05,383 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:49:05,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:49:05,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1589907842, now seen corresponding path program 3 times [2024-11-13 12:49:05,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:49:05,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681373624] [2024-11-13 12:49:05,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:05,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:49:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:49:06,818 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:49:06,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:49:06,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681373624] [2024-11-13 12:49:06,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681373624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:49:06,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228941809] [2024-11-13 12:49:06,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 12:49:06,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:49:06,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:49:06,822 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:49:06,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 12:49:07,333 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-13 12:49:07,334 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:49:07,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-13 12:49:07,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:49:07,355 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 12:49:07,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 12:49:07,411 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:49:07,412 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 12:49:07,423 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 12:49:07,474 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 12:49:07,483 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 15 treesize of output 1 [2024-11-13 12:49:07,715 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 12:49:07,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2024-11-13 12:49:07,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:49:07,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 12:49:07,901 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 12:49:07,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2024-11-13 12:49:07,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:49:07,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 12:49:08,156 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 12:49:08,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2024-11-13 12:49:08,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:49:08,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 12:49:08,432 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 12:49:08,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2024-11-13 12:49:08,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:49:08,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2024-11-13 12:49:08,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:49:08,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 12:49:08,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:49:08,666 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 12:49:08,821 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 12:49:08,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 12:49:08,887 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:49:08,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:49:16,581 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1138))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse9 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1139))) (or (forall ((v_ArrVal_1141 (Array Int Int))) (let ((.cse6 (store .cse9 .cse8 v_ArrVal_1141))) (let ((.cse0 (+ (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 8))) (or (< .cse0 0) (forall ((v_ArrVal_1142 Int) (v_ArrVal_1143 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_1140 (Array Int Int))) (let ((.cse4 (store .cse7 .cse8 v_ArrVal_1140))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse1 (store .cse6 .cse5 (store (select .cse6 .cse5) .cse0 v_ArrVal_1142)))) (or (forall ((v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1145 (Array Int Int))) (<= (+ (select (select (store .cse1 v_subst_2 v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 20) (select |c_#length| (select (select (store (store .cse4 .cse5 v_ArrVal_1143) v_subst_2 v_ArrVal_1145) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (< (select |c_#length| v_subst_2) (+ (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 16))))))))))) (< (select |c_#length| .cse8) (+ .cse3 8 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1138))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse16 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1139))) (or (forall ((v_ArrVal_1141 (Array Int Int))) (let ((.cse11 (store .cse16 .cse15 v_ArrVal_1141))) (let ((.cse13 (+ (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 8))) (or (forall ((v_ArrVal_1142 Int) (v_ArrVal_1140 (Array Int Int)) (v_subst_1 Int)) (let ((.cse10 (let ((.cse12 (select (select (store .cse14 .cse15 v_ArrVal_1140) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (store .cse11 .cse12 (store (select .cse11 .cse12) .cse13 v_ArrVal_1142))))) (or (forall ((v_ArrVal_1146 (Array Int Int))) (<= 0 (+ .cse3 16 (select (select (store .cse10 v_subst_1 v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (< (select |c_#length| v_subst_1) (+ (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 16))))) (< .cse13 0))))) (< (select |c_#length| .cse15) (+ .cse3 8 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))))) is different from false [2024-11-13 12:49:16,817 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_1138))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse8 (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_1139))) (or (forall ((v_ArrVal_1141 (Array Int Int))) (let ((.cse4 (store .cse8 .cse7 v_ArrVal_1141))) (let ((.cse0 (+ .cse1 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 8))) (or (< .cse0 0) (forall ((v_ArrVal_1142 Int) (v_ArrVal_1140 (Array Int Int)) (v_subst_1 Int)) (let ((.cse2 (let ((.cse5 (select (select (store .cse6 .cse7 v_ArrVal_1140) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (store .cse4 .cse5 (store (select .cse4 .cse5) .cse0 v_ArrVal_1142))))) (or (forall ((v_ArrVal_1146 (Array Int Int))) (<= 0 (+ .cse1 (select (select (store .cse2 v_subst_1 v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 16))) (< (select |c_#length| v_subst_1) (+ .cse1 (select (select .cse2 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 16))))))))) (< (select |c_#length| .cse7) (+ .cse1 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 8)))))) (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_1138))) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_1139)) (.cse10 (select (select .cse17 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (< (select |c_#length| .cse10) (+ .cse1 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 8)) (forall ((v_ArrVal_1141 (Array Int Int))) (let ((.cse16 (store .cse11 .cse10 v_ArrVal_1141))) (let ((.cse12 (+ .cse1 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 8))) (or (< .cse12 0) (forall ((v_ArrVal_1142 Int) (v_ArrVal_1143 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_1140 (Array Int Int))) (let ((.cse14 (store .cse17 .cse10 v_ArrVal_1140))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse13 (store .cse16 .cse15 (store (select .cse16 .cse15) .cse12 v_ArrVal_1142)))) (or (forall ((v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1145 (Array Int Int))) (<= (+ .cse1 (select (select (store .cse13 v_subst_2 v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 20) (select |c_#length| (select (select (store (store .cse14 .cse15 v_ArrVal_1143) v_subst_2 v_ArrVal_1145) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (< (select |c_#length| v_subst_2) (+ .cse1 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 16)))))))))))))))))) is different from false [2024-11-13 12:49:17,031 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_1138))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_1139)) (.cse0 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (< (select |c_#length| .cse0) (+ .cse1 (select (select .cse2 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 12)) (forall ((v_ArrVal_1141 (Array Int Int))) (let ((.cse5 (store .cse2 .cse0 v_ArrVal_1141))) (let ((.cse7 (+ .cse1 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 12))) (or (forall ((v_ArrVal_1142 Int) (v_ArrVal_1140 (Array Int Int)) (v_subst_1 Int)) (let ((.cse4 (let ((.cse6 (select (select (store .cse8 .cse0 v_ArrVal_1140) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_ArrVal_1142))))) (or (< (select |c_#length| v_subst_1) (+ (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse1 20)) (forall ((v_ArrVal_1146 (Array Int Int))) (<= 0 (+ .cse1 (select (select (store .cse4 v_subst_1 v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 20)))))) (< .cse7 0))))))))) (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_1138))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse17 (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_1139))) (or (forall ((v_ArrVal_1141 (Array Int Int))) (let ((.cse13 (store .cse17 .cse16 v_ArrVal_1141))) (let ((.cse14 (+ .cse1 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 12))) (or (forall ((v_ArrVal_1142 Int) (v_ArrVal_1143 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_1140 (Array Int Int))) (let ((.cse11 (store .cse15 .cse16 v_ArrVal_1140))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse10 (store .cse13 .cse12 (store (select .cse13 .cse12) .cse14 v_ArrVal_1142)))) (or (< (select |c_#length| v_subst_2) (+ (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse1 20)) (forall ((v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1145 (Array Int Int))) (<= (+ (select (select (store .cse10 v_subst_2 v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse1 24) (select |c_#length| (select (select (store (store .cse11 .cse12 v_ArrVal_1143) v_subst_2 v_ArrVal_1145) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))))) (< .cse14 0))))) (< (select |c_#length| .cse16) (+ .cse1 (select (select .cse17 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 12))))))))) is different from false [2024-11-13 12:49:17,183 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1137 (Array Int Int)) (v_ArrVal_1136 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1136))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse9 (store .cse11 .cse10 v_ArrVal_1138))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1137) .cse10 v_ArrVal_1139)) (.cse0 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse0) (+ (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 12)) (forall ((v_ArrVal_1141 (Array Int Int))) (let ((.cse7 (store .cse1 .cse0 v_ArrVal_1141))) (let ((.cse8 (+ .cse3 12 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (or (forall ((v_ArrVal_1142 Int) (v_ArrVal_1143 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_1140 (Array Int Int))) (let ((.cse5 (store .cse9 .cse0 v_ArrVal_1140))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse4 (store .cse7 .cse6 (store (select .cse7 .cse6) .cse8 v_ArrVal_1142)))) (or (forall ((v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1145 (Array Int Int))) (<= (+ .cse3 (select (select (store .cse4 v_subst_2 v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store (store .cse5 .cse6 v_ArrVal_1143) v_subst_2 v_ArrVal_1145) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (< (select |c_#length| v_subst_2) (+ (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 20))))))) (< .cse8 0))))))))))) (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1137 (Array Int Int)) (v_ArrVal_1136 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1136))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse18 (store .cse20 .cse19 v_ArrVal_1138))) (let ((.cse13 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1137) .cse19 v_ArrVal_1139)) (.cse12 (select (select .cse18 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse12) (+ (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 12)) (forall ((v_ArrVal_1141 (Array Int Int))) (let ((.cse15 (store .cse13 .cse12 v_ArrVal_1141))) (let ((.cse17 (+ .cse3 12 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (or (forall ((v_ArrVal_1142 Int) (v_ArrVal_1140 (Array Int Int)) (v_subst_1 Int)) (let ((.cse14 (let ((.cse16 (select (select (store .cse18 .cse12 v_ArrVal_1140) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 v_ArrVal_1142))))) (or (< (select |c_#length| v_subst_1) (+ (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 20)) (forall ((v_ArrVal_1146 (Array Int Int))) (<= 0 (+ (select (select (store .cse14 v_subst_1 v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 20)))))) (< .cse17 0))))))))))))) is different from false [2024-11-13 12:49:17,466 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1137 (Array Int Int)) (v_ArrVal_1136 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_1136))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse6 (store .cse11 .cse10 v_ArrVal_1138))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse8 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_1137) .cse10 v_ArrVal_1139))) (or (forall ((v_ArrVal_1141 (Array Int Int))) (let ((.cse4 (store .cse8 .cse7 v_ArrVal_1141))) (let ((.cse0 (+ .cse1 12 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (or (< .cse0 0) (forall ((v_ArrVal_1142 Int) (v_ArrVal_1140 (Array Int Int)) (v_subst_1 Int)) (let ((.cse2 (let ((.cse5 (select (select (store .cse6 .cse7 v_ArrVal_1140) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (store .cse4 .cse5 (store (select .cse4 .cse5) .cse0 v_ArrVal_1142))))) (or (forall ((v_ArrVal_1146 (Array Int Int))) (<= 0 (+ .cse1 20 (select (select (store .cse2 v_subst_1 v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (< (select |c_#length| v_subst_1) (+ .cse1 (select (select .cse2 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 20))))))))) (< (select |c_#length| .cse7) (+ .cse1 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 12)))))))) (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1137 (Array Int Int)) (v_ArrVal_1136 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_1136))) (let ((.cse20 (select (select .cse21 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse19 (store .cse21 .cse20 v_ArrVal_1138))) (let ((.cse13 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_1137) .cse20 v_ArrVal_1139)) (.cse12 (select (select .cse19 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (< (select |c_#length| .cse12) (+ .cse1 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 12)) (forall ((v_ArrVal_1141 (Array Int Int))) (let ((.cse18 (store .cse13 .cse12 v_ArrVal_1141))) (let ((.cse14 (+ .cse1 12 (select (select .cse18 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (or (< .cse14 0) (forall ((v_ArrVal_1142 Int) (v_ArrVal_1143 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_1140 (Array Int Int))) (let ((.cse16 (store .cse19 .cse12 v_ArrVal_1140))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse15 (store .cse18 .cse17 (store (select .cse18 .cse17) .cse14 v_ArrVal_1142)))) (or (forall ((v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1145 (Array Int Int))) (<= (+ .cse1 (select (select (store .cse15 v_subst_2 v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store (store .cse16 .cse17 v_ArrVal_1143) v_subst_2 v_ArrVal_1145) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (< (select |c_#length| v_subst_2) (+ .cse1 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 20)))))))))))))))))))) is different from false [2024-11-13 12:49:17,723 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1137 (Array Int Int)) (v_ArrVal_1136 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_1136))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_1138))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_1137) .cse10 v_ArrVal_1139)) (.cse0 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse0) (+ (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12)) (forall ((v_ArrVal_1141 (Array Int Int))) (let ((.cse7 (store .cse1 .cse0 v_ArrVal_1141))) (let ((.cse3 (+ 12 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (or (< .cse3 0) (forall ((v_ArrVal_1142 Int) (v_ArrVal_1143 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_1140 (Array Int Int))) (let ((.cse5 (store .cse8 .cse0 v_ArrVal_1140))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse4 (store .cse7 .cse6 (store (select .cse7 .cse6) .cse3 v_ArrVal_1142)))) (or (< (select |c_#length| v_subst_2) (+ (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 20)) (forall ((v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1145 (Array Int Int))) (<= (+ (select (select (store .cse4 v_subst_2 v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store (store .cse5 .cse6 v_ArrVal_1143) v_subst_2 v_ArrVal_1145) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))))))))))))))) (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1137 (Array Int Int)) (v_ArrVal_1136 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_1136))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse18 (store .cse20 .cse19 v_ArrVal_1138))) (let ((.cse13 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_1137) .cse19 v_ArrVal_1139)) (.cse12 (select (select .cse18 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse12) (+ (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12)) (forall ((v_ArrVal_1141 (Array Int Int))) (let ((.cse15 (store .cse13 .cse12 v_ArrVal_1141))) (let ((.cse17 (+ 12 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (or (forall ((v_ArrVal_1142 Int) (v_ArrVal_1140 (Array Int Int)) (v_subst_1 Int)) (let ((.cse14 (let ((.cse16 (select (select (store .cse18 .cse12 v_ArrVal_1140) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 v_ArrVal_1142))))) (or (< (select |c_#length| v_subst_1) (+ (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 20)) (forall ((v_ArrVal_1146 (Array Int Int))) (<= 0 (+ (select (select (store .cse14 v_subst_1 v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 20)))))) (< .cse17 0)))))))))))))) is different from false [2024-11-13 12:49:17,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:49:17,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1231 treesize of output 1161 [2024-11-13 12:49:17,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:49:17,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1151 treesize of output 681 [2024-11-13 12:49:18,452 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 413654551 treesize of output 363527119 [2024-11-13 12:49:22,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:49:22,877 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 718405581 treesize of output 715323849 [2024-11-13 12:49:25,038 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 2286 treesize of output 2090 [2024-11-13 12:49:25,084 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 2214 treesize of output 2182 [2024-11-13 12:49:25,130 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 1442 treesize of output 1386 [2024-11-13 12:49:25,175 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 2158 treesize of output 2134 [2024-11-13 12:49:25,238 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 2134 treesize of output 1934 [2024-11-13 12:49:25,288 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 1867 treesize of output 1471 [2024-11-13 12:49:25,337 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 1542 treesize of output 1430 [2024-11-13 12:49:25,384 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 948 treesize of output 872 [2024-11-13 12:49:25,445 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 872 treesize of output 796 [2024-11-13 12:49:44,410 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 5864 treesize of output 5576 [2024-11-13 12:49:59,667 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 4662 treesize of output 4398 [2024-11-13 12:50:26,066 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-13 12:50:26,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1053 treesize of output 1 [2024-11-13 12:50:34,063 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 27 refuted. 3 times theorem prover too weak. 0 trivial. 40 not checked. [2024-11-13 12:50:34,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228941809] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:50:34,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:50:34,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 21] total 52 [2024-11-13 12:50:34,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706093999] [2024-11-13 12:50:34,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:50:34,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-13 12:50:34,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:50:34,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-13 12:50:34,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1889, Unknown=10, NotChecked=570, Total=2756 [2024-11-13 12:50:34,068 INFO L87 Difference]: Start difference. First operand 183 states and 203 transitions. Second operand has 53 states, 52 states have (on average 2.019230769230769) internal successors, (105), 53 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:51:00,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:51:04,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:51:08,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:51:13,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:51:17,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:51:21,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:51:25,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:51:29,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:51:33,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:51:38,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:51:42,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:51:46,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:51:50,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:52:18,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:53:13,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:53:17,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:53:22,326 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|)) (.cse15 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse17 (select .cse15 .cse0)) (.cse9 (select .cse16 .cse0)) (.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_create_data_#t~mem7#1.offset| 4)) (.cse6 (select |c_#length| .cse9)) (.cse4 (+ .cse17 .cse1)) (.cse5 (+ .cse1 |c_ULTIMATE.start_create_data_#t~mem7#1.offset|)) (.cse3 (+ .cse17 .cse1 4)) (.cse7 (+ .cse17 .cse1 8))) (and (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1145 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1145) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse2))) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1145 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1145) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse3))) (<= 0 .cse4) (<= .cse2 (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem7#1.base|)) (<= 0 .cse5) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1146 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 4))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse2))) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1146 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 4))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse3))) (<= .cse3 .cse6) (<= .cse7 .cse6) (= (select |c_#valid| |c_ULTIMATE.start_create_data_~data~0#1.base|) 1) (or (< .cse4 0) (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| .cse9))) (and (forall ((v_ArrVal_1142 Int) (v_subst_1 Int)) (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| .cse9 (store .cse10 .cse4 v_ArrVal_1142)))) (or (< (select |c_#length| v_subst_1) (+ .cse1 8 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (forall ((v_ArrVal_1146 (Array Int Int))) (<= 0 (+ (select (select (store .cse8 v_subst_1 v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 8)))))) (forall ((v_ArrVal_1142 Int) (v_ArrVal_1143 (Array Int Int)) (v_subst_2 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| .cse9 (store .cse10 .cse4 v_ArrVal_1142)))) (or (forall ((v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1145 (Array Int Int))) (<= (+ .cse1 12 (select (select (store .cse11 v_subst_2 v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_1143) v_subst_2 v_ArrVal_1145) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (< (select |c_#length| v_subst_2) (+ .cse1 8 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))))))))) (or (< .cse5 0) (let ((.cse13 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base|))) (and (forall ((v_ArrVal_1142 Int) (v_ArrVal_1143 (Array Int Int)) (v_subst_2 Int)) (let ((.cse12 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| (store .cse13 .cse5 v_ArrVal_1142)))) (or (< (select |c_#length| v_subst_2) (+ .cse1 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) 8)) (forall ((v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1145 (Array Int Int))) (<= (+ .cse1 (select (select (store .cse12 v_subst_2 v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1143) v_subst_2 v_ArrVal_1145) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))))))) (forall ((v_ArrVal_1142 Int) (v_subst_1 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| (store .cse13 .cse5 v_ArrVal_1142)))) (or (< (select |c_#length| v_subst_1) (+ .cse1 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) 8)) (forall ((v_ArrVal_1146 (Array Int Int))) (<= 0 (+ .cse1 8 (select (select (store .cse14 v_subst_1 v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))))))))) (<= 0 .cse3) (<= (select |c_#length| |c_ULTIMATE.start_create_data_~data~0#1.base|) 8) (= (select .cse15 4) 0) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse7) (forall ((v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1145 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1145) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))))) (<= 80 (select |c_#length| (select .cse16 4))) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1146 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 8))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse7))) (= |c_ULTIMATE.start_create_data_~data~0#1.offset| 0))))) is different from false [2024-11-13 12:53:22,449 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_create_data_#t~mem7#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4)) (.cse3 (+ .cse1 |c_ULTIMATE.start_create_data_#t~mem7#1.offset|))) (and (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1145 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1145) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse2))) (<= .cse2 (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem7#1.base|)) (<= 0 .cse3) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1146 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 4))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse2))) (or (< .cse3 0) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base|))) (and (forall ((v_ArrVal_1142 Int) (v_ArrVal_1143 (Array Int Int)) (v_subst_2 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| (store .cse5 .cse3 v_ArrVal_1142)))) (or (< (select |c_#length| v_subst_2) (+ .cse1 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) 8)) (forall ((v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1145 (Array Int Int))) (<= (+ .cse1 (select (select (store .cse4 v_subst_2 v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1143) v_subst_2 v_ArrVal_1145) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))))))) (forall ((v_ArrVal_1142 Int) (v_subst_1 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| (store .cse5 .cse3 v_ArrVal_1142)))) (or (< (select |c_#length| v_subst_1) (+ .cse1 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) 8)) (forall ((v_ArrVal_1146 (Array Int Int))) (<= 0 (+ .cse1 8 (select (select (store .cse6 v_subst_1 v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))))))))))))) is different from false [2024-11-13 12:53:22,483 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse3 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (let ((.cse0 (+ .cse2 .cse3 8))) (and (<= .cse0 (select |c_#length| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (<= 0 (+ .cse2 .cse3 4)) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse0) (forall ((v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1145 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse3 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1145) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1146 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse3 8))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse0))))))) is different from false [2024-11-13 12:53:22,711 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)) (.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (let ((.cse2 (+ .cse3 .cse1 4))) (and (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1145 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1145) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse2))) (<= 0 (+ .cse3 .cse1)) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1146 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 4))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse2))) (<= .cse2 (select |c_#length| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))))))) is different from false [2024-11-13 12:53:22,931 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (let ((.cse0 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4)) (.cse2 (+ .cse1 |c_ULTIMATE.start_create_data_#t~mem7#1.offset| 4))) (and (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1145 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1145) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse2))) (<= .cse2 (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem7#1.base|)) (<= 0 (+ .cse1 |c_ULTIMATE.start_create_data_#t~mem7#1.offset|)) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1146 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1146) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 4))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse2)))))) is different from false [2024-11-13 12:53:23,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:53:23,884 INFO L93 Difference]: Finished difference Result 215 states and 238 transitions. [2024-11-13 12:53:23,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-13 12:53:23,885 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.019230769230769) internal successors, (105), 53 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-13 12:53:23,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:53:23,886 INFO L225 Difference]: With dead ends: 215 [2024-11-13 12:53:23,886 INFO L226 Difference]: Without dead ends: 215 [2024-11-13 12:53:23,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 109.2s TimeCoverageRelationStatistics Valid=668, Invalid=3634, Unknown=32, NotChecked=1518, Total=5852 [2024-11-13 12:53:23,889 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 157 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 22 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 2225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 949 IncrementalHoareTripleChecker+Unchecked, 72.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:53:23,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1307 Invalid, 2225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1234 Invalid, 20 Unknown, 949 Unchecked, 72.4s Time] [2024-11-13 12:53:23,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-13 12:53:23,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 208. [2024-11-13 12:53:23,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 191 states have (on average 1.2094240837696335) internal successors, (231), 207 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:53:23,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 231 transitions. [2024-11-13 12:53:23,896 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 231 transitions. Word has length 39 [2024-11-13 12:53:23,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:53:23,896 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 231 transitions. [2024-11-13 12:53:23,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.019230769230769) internal successors, (105), 53 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:53:23,896 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 231 transitions. [2024-11-13 12:53:23,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-13 12:53:23,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:53:23,897 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:53:23,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-13 12:53:24,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-13 12:53:24,099 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:53:24,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:53:24,099 INFO L85 PathProgramCache]: Analyzing trace with hash 564913566, now seen corresponding path program 1 times [2024-11-13 12:53:24,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:53:24,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30580588] [2024-11-13 12:53:24,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:53:24,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:53:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:26,903 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 12:53:26,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:53:26,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30580588] [2024-11-13 12:53:26,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30580588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:53:26,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:53:26,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-13 12:53:26,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368349229] [2024-11-13 12:53:26,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:53:26,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 12:53:26,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:53:26,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 12:53:26,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2024-11-13 12:53:26,905 INFO L87 Difference]: Start difference. First operand 208 states and 231 transitions. Second operand has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:53:34,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:53:34,467 INFO L93 Difference]: Finished difference Result 301 states and 327 transitions. [2024-11-13 12:53:34,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 12:53:34,468 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-13 12:53:34,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:53:34,469 INFO L225 Difference]: With dead ends: 301 [2024-11-13 12:53:34,469 INFO L226 Difference]: Without dead ends: 301 [2024-11-13 12:53:34,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=203, Invalid=1357, Unknown=0, NotChecked=0, Total=1560 [2024-11-13 12:53:34,470 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 134 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:53:34,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 740 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-13 12:53:34,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-13 12:53:34,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 199. [2024-11-13 12:53:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 182 states have (on average 1.2087912087912087) internal successors, (220), 198 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:53:34,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 220 transitions. [2024-11-13 12:53:34,478 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 220 transitions. Word has length 41 [2024-11-13 12:53:34,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:53:34,478 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 220 transitions. [2024-11-13 12:53:34,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:53:34,478 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 220 transitions. [2024-11-13 12:53:34,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 12:53:34,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:53:34,479 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:53:34,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-13 12:53:34,479 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:53:34,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:53:34,480 INFO L85 PathProgramCache]: Analyzing trace with hash 741230734, now seen corresponding path program 1 times [2024-11-13 12:53:34,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:53:34,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663730245] [2024-11-13 12:53:34,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:53:34,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:53:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:38,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:53:38,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:53:38,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663730245] [2024-11-13 12:53:38,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663730245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:53:38,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532824869] [2024-11-13 12:53:38,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:53:38,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:53:38,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:53:38,386 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:53:38,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 12:53:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:53:38,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-13 12:53:38,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:53:38,838 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 12:53:39,316 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:53:39,316 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 12:53:39,778 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 12:53:39,806 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 12:53:40,287 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 12:53:40,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 12:53:41,348 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 27 treesize of output 15 [2024-11-13 12:53:41,372 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 12:53:41,812 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-13 12:53:41,813 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 23 treesize of output 15 [2024-11-13 12:53:46,184 INFO L349 Elim1Store]: treesize reduction 24, result has 86.9 percent of original size [2024-11-13 12:53:46,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 145 treesize of output 226 [2024-11-13 12:53:46,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:53:46,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 74 [2024-11-13 12:53:54,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-13 12:53:54,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:53:54,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:53:54,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532824869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:53:54,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:53:54,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [17] total 36 [2024-11-13 12:53:54,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054878981] [2024-11-13 12:53:54,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:53:54,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 12:53:54,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:53:54,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 12:53:54,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1167, Unknown=0, NotChecked=0, Total=1260 [2024-11-13 12:53:54,828 INFO L87 Difference]: Start difference. First operand 199 states and 220 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:54:00,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:54:00,690 INFO L93 Difference]: Finished difference Result 308 states and 336 transitions. [2024-11-13 12:54:00,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 12:54:00,691 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-13 12:54:00,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:54:00,692 INFO L225 Difference]: With dead ends: 308 [2024-11-13 12:54:00,692 INFO L226 Difference]: Without dead ends: 302 [2024-11-13 12:54:00,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=162, Invalid=1908, Unknown=0, NotChecked=0, Total=2070 [2024-11-13 12:54:00,694 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 72 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:54:00,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 635 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-13 12:54:00,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-13 12:54:00,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 221. [2024-11-13 12:54:00,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 204 states have (on average 1.196078431372549) internal successors, (244), 220 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:54:00,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 244 transitions. [2024-11-13 12:54:00,702 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 244 transitions. Word has length 43 [2024-11-13 12:54:00,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:54:00,702 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 244 transitions. [2024-11-13 12:54:00,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:54:00,702 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 244 transitions. [2024-11-13 12:54:00,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-13 12:54:00,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:54:00,704 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:54:00,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-13 12:54:00,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-13 12:54:00,905 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:54:00,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:54:00,906 INFO L85 PathProgramCache]: Analyzing trace with hash 149236731, now seen corresponding path program 1 times [2024-11-13 12:54:00,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:54:00,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962559430] [2024-11-13 12:54:00,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:54:00,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:54:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:54:02,620 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:54:02,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:54:02,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962559430] [2024-11-13 12:54:02,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962559430] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:54:02,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294550654] [2024-11-13 12:54:02,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:54:02,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:54:02,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:54:02,623 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:54:02,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 12:54:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:54:02,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-13 12:54:02,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:54:03,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 12:54:04,295 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 15 treesize of output 11 [2024-11-13 12:54:04,910 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 27 treesize of output 15 [2024-11-13 12:54:05,303 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:54:05,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:54:05,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2024-11-13 12:54:06,159 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-11-13 12:54:06,159 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 30 treesize of output 20 [2024-11-13 12:54:06,834 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 13 [2024-11-13 12:54:07,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 12:54:07,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-13 12:54:07,617 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:54:07,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:54:08,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 12:54:09,706 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 358 treesize of output 326 [2024-11-13 12:54:10,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-11-13 12:54:12,155 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:54:12,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294550654] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:54:12,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:54:12,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 36 [2024-11-13 12:54:12,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330827097] [2024-11-13 12:54:12,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:54:12,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-13 12:54:12,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:54:12,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-13 12:54:12,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1119, Unknown=0, NotChecked=0, Total=1260 [2024-11-13 12:54:12,158 INFO L87 Difference]: Start difference. First operand 221 states and 244 transitions. Second operand has 36 states, 36 states have (on average 3.2777777777777777) internal successors, (118), 36 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:54:19,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:54:19,391 INFO L93 Difference]: Finished difference Result 347 states and 383 transitions. [2024-11-13 12:54:19,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 12:54:19,391 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.2777777777777777) internal successors, (118), 36 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-13 12:54:19,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:54:19,393 INFO L225 Difference]: With dead ends: 347 [2024-11-13 12:54:19,393 INFO L226 Difference]: Without dead ends: 347 [2024-11-13 12:54:19,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=330, Invalid=1926, Unknown=0, NotChecked=0, Total=2256 [2024-11-13 12:54:19,394 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 313 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:54:19,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1705 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-13 12:54:19,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-13 12:54:19,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 230. [2024-11-13 12:54:19,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 213 states have (on average 1.187793427230047) internal successors, (253), 229 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:54:19,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 253 transitions. [2024-11-13 12:54:19,402 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 253 transitions. Word has length 44 [2024-11-13 12:54:19,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:54:19,402 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 253 transitions. [2024-11-13 12:54:19,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.2777777777777777) internal successors, (118), 36 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:54:19,403 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 253 transitions. [2024-11-13 12:54:19,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-13 12:54:19,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:54:19,404 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:54:19,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 12:54:19,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-13 12:54:19,604 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:54:19,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:54:19,605 INFO L85 PathProgramCache]: Analyzing trace with hash 149236703, now seen corresponding path program 1 times [2024-11-13 12:54:19,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:54:19,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969075343] [2024-11-13 12:54:19,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:54:19,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:54:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:54:21,929 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:54:21,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:54:21,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969075343] [2024-11-13 12:54:21,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969075343] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:54:21,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746682790] [2024-11-13 12:54:21,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:54:21,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:54:21,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:54:21,932 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:54:21,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 12:54:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:54:22,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-13 12:54:22,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:54:22,353 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 12:54:22,925 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 15 treesize of output 1 [2024-11-13 12:54:23,273 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-13 12:54:23,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-11-13 12:54:24,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-13 12:54:24,709 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 12:54:25,164 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:54:25,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:54:25,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 39 [2024-11-13 12:54:26,280 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-11-13 12:54:26,280 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 47 treesize of output 29 [2024-11-13 12:54:27,919 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 57 treesize of output 49 [2024-11-13 12:54:28,980 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-13 12:54:28,980 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 22 treesize of output 17 [2024-11-13 12:54:29,397 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:54:29,400 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:54:29,401 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 28 treesize of output 8 [2024-11-13 12:54:29,756 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 12:54:29,768 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:54:29,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:54:31,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 12:54:32,571 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 486 treesize of output 454 [2024-11-13 12:54:35,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:54:35,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 37 [2024-11-13 12:54:35,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:54:35,577 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 37 treesize of output 39 [2024-11-13 12:54:35,641 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 44 treesize of output 40 [2024-11-13 12:54:35,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:54:35,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 73 treesize of output 75 [2024-11-13 12:54:36,401 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-13 12:54:36,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 98 [2024-11-13 12:54:36,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:54:36,443 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 98 treesize of output 96 [2024-11-13 12:54:36,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-13 12:54:36,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:54:36,604 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 136 treesize of output 150 [2024-11-13 12:54:43,848 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-13 12:54:43,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 91 [2024-11-13 12:54:43,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:54:43,896 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 91 treesize of output 89 [2024-11-13 12:54:43,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-13 12:54:44,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:54:44,087 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 121 treesize of output 135 [2024-11-13 12:55:08,654 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:55:08,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746682790] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:55:08,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:55:08,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 17] total 40 [2024-11-13 12:55:08,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540859819] [2024-11-13 12:55:08,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:55:08,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-13 12:55:08,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:55:08,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-13 12:55:08,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1471, Unknown=0, NotChecked=0, Total=1640 [2024-11-13 12:55:08,657 INFO L87 Difference]: Start difference. First operand 230 states and 253 transitions. Second operand has 41 states, 40 states have (on average 3.0) internal successors, (120), 41 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:55:19,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:55:19,779 INFO L93 Difference]: Finished difference Result 343 states and 376 transitions. [2024-11-13 12:55:19,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:55:19,781 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.0) internal successors, (120), 41 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-13 12:55:19,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:55:19,782 INFO L225 Difference]: With dead ends: 343 [2024-11-13 12:55:19,782 INFO L226 Difference]: Without dead ends: 343 [2024-11-13 12:55:19,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=388, Invalid=2474, Unknown=0, NotChecked=0, Total=2862 [2024-11-13 12:55:19,784 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 250 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:55:19,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1202 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-11-13 12:55:19,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-13 12:55:19,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 232. [2024-11-13 12:55:19,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 215 states have (on average 1.1906976744186046) internal successors, (256), 231 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:55:19,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 256 transitions. [2024-11-13 12:55:19,792 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 256 transitions. Word has length 44 [2024-11-13 12:55:19,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:55:19,793 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 256 transitions. [2024-11-13 12:55:19,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.0) internal successors, (120), 41 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:55:19,793 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 256 transitions. [2024-11-13 12:55:19,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-13 12:55:19,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:55:19,794 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:55:19,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 12:55:19,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-13 12:55:19,995 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:55:19,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:55:19,995 INFO L85 PathProgramCache]: Analyzing trace with hash 149236704, now seen corresponding path program 1 times [2024-11-13 12:55:19,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:55:19,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294774551] [2024-11-13 12:55:19,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:55:19,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:55:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:55:22,563 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:55:22,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:55:22,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294774551] [2024-11-13 12:55:22,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294774551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:55:22,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312368481] [2024-11-13 12:55:22,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:55:22,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:55:22,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:55:22,566 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:55:22,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 12:55:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:55:22,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-13 12:55:22,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:55:22,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 12:55:22,973 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 12:55:23,764 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 12:55:23,814 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 15 treesize of output 1 [2024-11-13 12:55:24,178 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-13 12:55:24,179 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 12:55:24,233 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 12:55:24,583 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:55:24,584 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 12:55:24,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-13 12:55:25,024 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 12:55:25,817 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 12:55:25,898 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 12:55:26,372 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:55:26,376 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:55:26,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 25 [2024-11-13 12:55:27,559 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:55:27,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:55:27,611 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 47 treesize of output 29 [2024-11-13 12:55:27,632 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:55:27,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:55:27,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 19 [2024-11-13 12:55:31,184 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 19 treesize of output 11 [2024-11-13 12:55:31,223 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:55:31,227 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:55:31,228 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 28 treesize of output 8 [2024-11-13 12:55:31,635 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 12:55:31,890 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:55:31,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:55:34,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 12:55:36,082 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 614 treesize of output 582 [2024-11-13 12:55:36,098 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 677 treesize of output 597 [2024-11-13 12:55:36,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:55:38,297 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 28 [2024-11-13 12:55:38,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:55:38,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-13 12:55:38,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:55:38,474 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 19 treesize of output 23 [2024-11-13 12:55:38,505 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 14 treesize of output 12 [2024-11-13 12:55:38,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:55:38,614 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 29 treesize of output 33 [2024-11-13 12:55:38,872 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 66 treesize of output 62 [2024-11-13 12:55:38,885 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 102 treesize of output 94 [2024-11-13 12:55:42,855 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:55:42,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312368481] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:55:42,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:55:42,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 16] total 41 [2024-11-13 12:55:42,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859375369] [2024-11-13 12:55:42,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:55:42,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-13 12:55:42,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:55:42,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-13 12:55:42,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1583, Unknown=0, NotChecked=0, Total=1722 [2024-11-13 12:55:42,858 INFO L87 Difference]: Start difference. First operand 232 states and 256 transitions. Second operand has 42 states, 41 states have (on average 3.1463414634146343) internal successors, (129), 42 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:55:59,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:55:59,393 INFO L93 Difference]: Finished difference Result 353 states and 386 transitions. [2024-11-13 12:55:59,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 12:55:59,394 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.1463414634146343) internal successors, (129), 42 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-13 12:55:59,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:55:59,396 INFO L225 Difference]: With dead ends: 353 [2024-11-13 12:55:59,396 INFO L226 Difference]: Without dead ends: 353 [2024-11-13 12:55:59,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=499, Invalid=3407, Unknown=0, NotChecked=0, Total=3906 [2024-11-13 12:55:59,398 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 429 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:55:59,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1622 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2024-11-13 12:55:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-13 12:55:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 232. [2024-11-13 12:55:59,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 215 states have (on average 1.186046511627907) internal successors, (255), 231 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:55:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 255 transitions. [2024-11-13 12:55:59,412 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 255 transitions. Word has length 44 [2024-11-13 12:55:59,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:55:59,417 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 255 transitions. [2024-11-13 12:55:59,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.1463414634146343) internal successors, (129), 42 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:55:59,418 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 255 transitions. [2024-11-13 12:55:59,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 12:55:59,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:55:59,419 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:55:59,455 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 12:55:59,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-13 12:55:59,623 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:55:59,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:55:59,624 INFO L85 PathProgramCache]: Analyzing trace with hash 619529314, now seen corresponding path program 1 times [2024-11-13 12:55:59,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:55:59,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41930076] [2024-11-13 12:55:59,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:55:59,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:55:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:55:59,828 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 12:55:59,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:55:59,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41930076] [2024-11-13 12:55:59,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41930076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:55:59,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:55:59,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:55:59,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402000907] [2024-11-13 12:55:59,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:55:59,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:55:59,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:55:59,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:55:59,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:55:59,830 INFO L87 Difference]: Start difference. First operand 232 states and 255 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:56:00,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:56:00,547 INFO L93 Difference]: Finished difference Result 243 states and 265 transitions. [2024-11-13 12:56:00,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:56:00,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-13 12:56:00,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:56:00,549 INFO L225 Difference]: With dead ends: 243 [2024-11-13 12:56:00,549 INFO L226 Difference]: Without dead ends: 243 [2024-11-13 12:56:00,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:56:00,550 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 26 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 12:56:00,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 186 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 12:56:00,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-13 12:56:00,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 231. [2024-11-13 12:56:00,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 215 states have (on average 1.1813953488372093) internal successors, (254), 230 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:56:00,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 254 transitions. [2024-11-13 12:56:00,554 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 254 transitions. Word has length 47 [2024-11-13 12:56:00,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:56:00,555 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 254 transitions. [2024-11-13 12:56:00,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:56:00,555 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 254 transitions. [2024-11-13 12:56:00,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 12:56:00,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:56:00,556 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:56:00,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-13 12:56:00,556 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:56:00,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:56:00,556 INFO L85 PathProgramCache]: Analyzing trace with hash 619529315, now seen corresponding path program 1 times [2024-11-13 12:56:00,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:56:00,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645023925] [2024-11-13 12:56:00,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:56:00,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:56:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:56:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:56:02,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:56:02,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645023925] [2024-11-13 12:56:02,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645023925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:56:02,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279764765] [2024-11-13 12:56:02,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:56:02,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:56:02,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:56:02,273 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:56:02,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 12:56:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:56:02,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-13 12:56:02,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:56:03,052 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 12:56:03,473 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 12:56:03,723 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 12:56:04,156 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 12:56:04,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 12:56:04,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:56:04,934 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 29 treesize of output 19 [2024-11-13 12:56:06,036 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 19 treesize of output 11 [2024-11-13 12:56:06,869 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 12:56:07,080 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:56:07,081 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:56:07,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:56:07,581 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 31 treesize of output 35 [2024-11-13 12:56:09,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 12:56:09,628 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 40 treesize of output 36 [2024-11-13 12:56:11,118 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 70 treesize of output 66 [2024-11-13 12:56:11,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 17 treesize of output 15 [2024-11-13 12:56:11,178 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 52 treesize of output 50 [2024-11-13 12:56:11,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:56:11,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 91 [2024-11-13 12:56:11,321 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 114 treesize of output 110 [2024-11-13 12:56:11,438 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 154 treesize of output 148 [2024-11-13 12:56:11,577 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 20 treesize of output 16 [2024-11-13 12:56:12,456 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 28 [2024-11-13 12:56:13,102 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:56:13,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279764765] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:56:13,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:56:13,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 17] total 47 [2024-11-13 12:56:13,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246005966] [2024-11-13 12:56:13,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:56:13,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-13 12:56:13,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:56:13,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-13 12:56:13,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2037, Unknown=0, NotChecked=0, Total=2256 [2024-11-13 12:56:13,105 INFO L87 Difference]: Start difference. First operand 231 states and 254 transitions. Second operand has 48 states, 47 states have (on average 2.9361702127659575) internal successors, (138), 48 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:56:19,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:56:19,706 INFO L93 Difference]: Finished difference Result 279 states and 309 transitions. [2024-11-13 12:56:19,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:56:19,707 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.9361702127659575) internal successors, (138), 48 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-13 12:56:19,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:56:19,708 INFO L225 Difference]: With dead ends: 279 [2024-11-13 12:56:19,708 INFO L226 Difference]: Without dead ends: 279 [2024-11-13 12:56:19,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=506, Invalid=3526, Unknown=0, NotChecked=0, Total=4032 [2024-11-13 12:56:19,710 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 367 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-13 12:56:19,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1044 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-13 12:56:19,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-13 12:56:19,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 234. [2024-11-13 12:56:19,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 218 states have (on average 1.1743119266055047) internal successors, (256), 233 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:56:19,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 256 transitions. [2024-11-13 12:56:19,716 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 256 transitions. Word has length 47 [2024-11-13 12:56:19,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:56:19,716 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 256 transitions. [2024-11-13 12:56:19,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.9361702127659575) internal successors, (138), 48 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:56:19,717 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 256 transitions. [2024-11-13 12:56:19,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 12:56:19,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:56:19,717 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:56:19,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 12:56:19,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:56:19,918 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 12:56:19,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:56:19,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1168815799, now seen corresponding path program 1 times [2024-11-13 12:56:19,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:56:19,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524727926] [2024-11-13 12:56:19,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:56:19,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:56:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:56:29,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:56:29,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:56:29,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524727926] [2024-11-13 12:56:29,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524727926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:56:29,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606028921] [2024-11-13 12:56:29,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:56:29,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:56:29,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:56:29,360 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:56:29,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 12:56:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:56:29,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-13 12:56:29,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:56:32,380 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 15 treesize of output 1 [2024-11-13 12:56:32,959 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-13 12:56:32,959 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 23 treesize of output 15 [2024-11-13 12:56:40,649 INFO L349 Elim1Store]: treesize reduction 24, result has 78.4 percent of original size [2024-11-13 12:56:40,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 193 [2024-11-13 12:57:04,468 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 289 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 12:57:04,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:57:04,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 894 treesize of output 1202 [2024-11-13 12:57:04,573 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 678 treesize of output 666 [2024-11-13 12:58:15,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:58:15,894 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:58:24,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 12:58:26,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:58:26,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 347 treesize of output 333 [2024-11-13 12:59:33,132 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 199 treesize of output 185 [2024-11-13 12:59:33,152 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 287 treesize of output 273 [2024-11-13 12:59:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:59:34,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606028921] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:59:34,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:59:34,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 23] total 65 [2024-11-13 12:59:34,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905490630] [2024-11-13 12:59:34,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:59:34,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-11-13 12:59:34,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:34,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-11-13 12:59:34,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=4143, Unknown=12, NotChecked=0, Total=4422 [2024-11-13 12:59:34,272 INFO L87 Difference]: Start difference. First operand 234 states and 256 transitions. Second operand has 67 states, 66 states have (on average 2.0303030303030303) internal successors, (134), 66 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:00:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:24,008 INFO L93 Difference]: Finished difference Result 287 states and 311 transitions. [2024-11-13 13:00:24,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 13:00:24,010 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 2.0303030303030303) internal successors, (134), 66 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-13 13:00:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:24,011 INFO L225 Difference]: With dead ends: 287 [2024-11-13 13:00:24,011 INFO L226 Difference]: Without dead ends: 285 [2024-11-13 13:00:24,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1581 ImplicationChecksByTransitivity, 128.8s TimeCoverageRelationStatistics Valid=596, Invalid=7224, Unknown=12, NotChecked=0, Total=7832 [2024-11-13 13:00:24,013 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 270 mSDsluCounter, 1893 mSDsCounter, 0 mSdLazyCounter, 2516 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 2559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:24,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1952 Invalid, 2559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2516 Invalid, 0 Unknown, 0 Unchecked, 21.7s Time] [2024-11-13 13:00:24,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-13 13:00:24,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 250. [2024-11-13 13:00:24,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 234 states have (on average 1.1623931623931625) internal successors, (272), 249 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:00:24,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 272 transitions. [2024-11-13 13:00:24,020 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 272 transitions. Word has length 47 [2024-11-13 13:00:24,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:24,020 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 272 transitions. [2024-11-13 13:00:24,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 2.0303030303030303) internal successors, (134), 66 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:00:24,020 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 272 transitions. [2024-11-13 13:00:24,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 13:00:24,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:24,021 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:24,047 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 13:00:24,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2024-11-13 13:00:24,226 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 13:00:24,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:24,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1168815827, now seen corresponding path program 1 times [2024-11-13 13:00:24,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:24,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311612164] [2024-11-13 13:00:24,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:24,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:26,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:00:26,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:26,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311612164] [2024-11-13 13:00:26,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311612164] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:00:26,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458564187] [2024-11-13 13:00:26,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:26,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:26,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:26,610 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:26,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8ebfc28-36dc-4422-a92e-b86b9b2aa612/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 13:00:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:26,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-13 13:00:26,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:00:26,941 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 13:00:27,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:00:27,191 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 15 treesize of output 15 [2024-11-13 13:00:27,477 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 15 treesize of output 11 [2024-11-13 13:00:27,523 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 15 treesize of output 1 [2024-11-13 13:00:27,949 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:00:27,950 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 13:00:28,275 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 13:00:28,309 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 21 treesize of output 16 [2024-11-13 13:00:28,463 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 21 treesize of output 16 [2024-11-13 13:00:28,507 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 13:00:29,116 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 13:00:29,139 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 16 [2024-11-13 13:00:29,652 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2024-11-13 13:00:29,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 34 [2024-11-13 13:00:32,617 INFO L349 Elim1Store]: treesize reduction 24, result has 54.7 percent of original size [2024-11-13 13:00:32,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 157 [2024-11-13 13:00:48,853 WARN L286 SmtUtils]: Spent 11.36s on a formula simplification. DAG size of input: 538 DAG size of output: 458 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 13:00:48,853 INFO L349 Elim1Store]: treesize reduction 984, result has 65.6 percent of original size [2024-11-13 13:00:48,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 2 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 274 case distinctions, treesize of input 482 treesize of output 2138