./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB --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 e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:07:08,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:07:08,562 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 03:07:08,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:07:08,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:07:08,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:07:08,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:07:08,620 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:07:08,620 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:07:08,621 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:07:08,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:07:08,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:07:08,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:07:08,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:07:08,623 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:07:08,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:07:08,625 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:07:08,625 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:07:08,625 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:07:08,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:07:08,625 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 03:07:08,625 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 03:07:08,625 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 03:07:08,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:07:08,626 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:07:08,626 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:07:08,626 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:07:08,626 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:07:08,626 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:07:08,626 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:07:08,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:07:08,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:07:08,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:07:08,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:07:08,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:07:08,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:07:08,627 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:07:08,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:07:08,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:07:08,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:07:08,627 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:07:08,627 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:07:08,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:07:08,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:07:08,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:07:08,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:07:08,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:07:08,630 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_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB 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 -> e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c [2024-11-28 03:07:08,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:07:09,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:07:09,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:07:09,017 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:07:09,017 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:07:09,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2024-11-28 03:07:12,098 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/data/1a4636f2e/c5d79a6394c540c99d9f08227cb9f6df/FLAGd0e87f6f9 [2024-11-28 03:07:12,435 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:07:12,440 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2024-11-28 03:07:12,470 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/data/1a4636f2e/c5d79a6394c540c99d9f08227cb9f6df/FLAGd0e87f6f9 [2024-11-28 03:07:12,662 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/data/1a4636f2e/c5d79a6394c540c99d9f08227cb9f6df [2024-11-28 03:07:12,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:07:12,667 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:07:12,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:07:12,669 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:07:12,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:07:12,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:07:12" (1/1) ... [2024-11-28 03:07:12,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d7194c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:07:12, skipping insertion in model container [2024-11-28 03:07:12,677 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:07:12" (1/1) ... [2024-11-28 03:07:12,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:07:13,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:07:13,045 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:07:13,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:07:13,138 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:07:13,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:07:13 WrapperNode [2024-11-28 03:07:13,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:07:13,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:07:13,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:07:13,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:07:13,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:07:13" (1/1) ... [2024-11-28 03:07:13,166 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:07:13" (1/1) ... [2024-11-28 03:07:13,193 INFO L138 Inliner]: procedures = 123, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 217 [2024-11-28 03:07:13,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:07:13,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:07:13,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:07:13,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:07:13,206 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:07:13" (1/1) ... [2024-11-28 03:07:13,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:07:13" (1/1) ... [2024-11-28 03:07:13,211 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:07:13" (1/1) ... [2024-11-28 03:07:13,241 INFO L175 MemorySlicer]: Split 49 memory accesses to 2 slices as follows [2, 47]. 96 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 17 writes are split as follows [0, 17]. [2024-11-28 03:07:13,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:07:13" (1/1) ... [2024-11-28 03:07:13,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:07:13" (1/1) ... [2024-11-28 03:07:13,254 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:07:13" (1/1) ... [2024-11-28 03:07:13,255 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:07:13" (1/1) ... [2024-11-28 03:07:13,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:07:13" (1/1) ... [2024-11-28 03:07:13,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:07:13" (1/1) ... [2024-11-28 03:07:13,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:07:13" (1/1) ... [2024-11-28 03:07:13,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:07:13,268 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:07:13,268 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:07:13,268 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:07:13,269 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:07:13" (1/1) ... [2024-11-28 03:07:13,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:07:13,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:07:13,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:07:13,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:07:13,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:07:13,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:07:13,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 03:07:13,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 03:07:13,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 03:07:13,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 03:07:13,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 03:07:13,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:07:13,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 03:07:13,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:07:13,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:07:13,531 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:07:13,532 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:07:14,405 INFO L? ?]: Removed 233 outVars from TransFormulas that were not future-live. [2024-11-28 03:07:14,405 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:07:14,432 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:07:14,433 INFO L312 CfgBuilder]: Removed 7 assume(true) statements. [2024-11-28 03:07:14,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:07:14 BoogieIcfgContainer [2024-11-28 03:07:14,433 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:07:14,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:07:14,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:07:14,446 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:07:14,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:07:12" (1/3) ... [2024-11-28 03:07:14,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb16d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:07:14, skipping insertion in model container [2024-11-28 03:07:14,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:07:13" (2/3) ... [2024-11-28 03:07:14,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb16d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:07:14, skipping insertion in model container [2024-11-28 03:07:14,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:07:14" (3/3) ... [2024-11-28 03:07:14,453 INFO L128 eAbstractionObserver]: Analyzing ICFG tree_of_cslls.i [2024-11-28 03:07:14,472 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:07:14,474 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree_of_cslls.i that has 1 procedures, 217 locations, 1 initial locations, 7 loop locations, and 104 error locations. [2024-11-28 03:07:14,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:07:14,565 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;@706a3f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:07:14,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2024-11-28 03:07:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 217 states, 112 states have (on average 2.142857142857143) internal successors, (240), 216 states have internal predecessors, (240), 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-28 03:07:14,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 03:07:14,580 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:07:14,581 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 03:07:14,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:07:14,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:07:14,590 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-28 03:07:14,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:07:14,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512823149] [2024-11-28 03:07:14,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:07:14,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:07:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:07:14,865 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-28 03:07:14,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:07:14,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512823149] [2024-11-28 03:07:14,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512823149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:07:14,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:07:14,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:07:14,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572215166] [2024-11-28 03:07:14,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:07:14,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:07:14,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:07:14,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:07:14,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:07:14,915 INFO L87 Difference]: Start difference. First operand has 217 states, 112 states have (on average 2.142857142857143) internal successors, (240), 216 states have internal predecessors, (240), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-28 03:07:15,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:07:15,366 INFO L93 Difference]: Finished difference Result 286 states and 309 transitions. [2024-11-28 03:07:15,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:07:15,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-28 03:07:15,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:07:15,386 INFO L225 Difference]: With dead ends: 286 [2024-11-28 03:07:15,386 INFO L226 Difference]: Without dead ends: 284 [2024-11-28 03:07:15,391 INFO L434 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-28 03:07:15,397 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 193 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:07:15,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 208 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:07:15,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-28 03:07:15,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 206. [2024-11-28 03:07:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 111 states have (on average 2.0) internal successors, (222), 205 states have internal predecessors, (222), 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-28 03:07:15,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 222 transitions. [2024-11-28 03:07:15,457 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 222 transitions. Word has length 3 [2024-11-28 03:07:15,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:07:15,458 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 222 transitions. [2024-11-28 03:07:15,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-28 03:07:15,458 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 222 transitions. [2024-11-28 03:07:15,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 03:07:15,459 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:07:15,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 03:07:15,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:07:15,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:07:15,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:07:15,460 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-28 03:07:15,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:07:15,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873653859] [2024-11-28 03:07:15,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:07:15,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:07:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:07:15,647 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-28 03:07:15,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:07:15,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873653859] [2024-11-28 03:07:15,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873653859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:07:15,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:07:15,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:07:15,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487782871] [2024-11-28 03:07:15,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:07:15,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:07:15,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:07:15,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:07:15,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:07:15,650 INFO L87 Difference]: Start difference. First operand 206 states and 222 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-28 03:07:15,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:07:15,918 INFO L93 Difference]: Finished difference Result 204 states and 220 transitions. [2024-11-28 03:07:15,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:07:15,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-28 03:07:15,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:07:15,920 INFO L225 Difference]: With dead ends: 204 [2024-11-28 03:07:15,921 INFO L226 Difference]: Without dead ends: 204 [2024-11-28 03:07:15,921 INFO L434 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-28 03:07:15,922 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 2 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:07:15,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 332 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:07:15,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-28 03:07:15,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-28 03:07:15,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 111 states have (on average 1.981981981981982) internal successors, (220), 203 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-28 03:07:15,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 220 transitions. [2024-11-28 03:07:15,934 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 220 transitions. Word has length 3 [2024-11-28 03:07:15,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:07:15,935 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 220 transitions. [2024-11-28 03:07:15,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-28 03:07:15,935 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 220 transitions. [2024-11-28 03:07:15,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 03:07:15,936 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:07:15,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 03:07:15,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:07:15,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:07:15,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:07:15,937 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2024-11-28 03:07:15,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:07:15,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694167109] [2024-11-28 03:07:15,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:07:15,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:07:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:07:16,208 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-28 03:07:16,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:07:16,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694167109] [2024-11-28 03:07:16,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694167109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:07:16,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:07:16,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:07:16,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194892285] [2024-11-28 03:07:16,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:07:16,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:07:16,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:07:16,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:07:16,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:07:16,213 INFO L87 Difference]: Start difference. First operand 204 states and 220 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-28 03:07:16,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:07:16,753 INFO L93 Difference]: Finished difference Result 359 states and 389 transitions. [2024-11-28 03:07:16,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:07:16,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2024-11-28 03:07:16,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:07:16,755 INFO L225 Difference]: With dead ends: 359 [2024-11-28 03:07:16,755 INFO L226 Difference]: Without dead ends: 359 [2024-11-28 03:07:16,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:07:16,759 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 473 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:07:16,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 210 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:07:16,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-28 03:07:16,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 197. [2024-11-28 03:07:16,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 111 states have (on average 1.9189189189189189) internal successors, (213), 196 states have internal predecessors, (213), 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-28 03:07:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 213 transitions. [2024-11-28 03:07:16,789 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 213 transitions. Word has length 6 [2024-11-28 03:07:16,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:07:16,790 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 213 transitions. [2024-11-28 03:07:16,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-28 03:07:16,790 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2024-11-28 03:07:16,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 03:07:16,790 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:07:16,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:07:16,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:07:16,791 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:07:16,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:07:16,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924364, now seen corresponding path program 1 times [2024-11-28 03:07:16,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:07:16,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131314662] [2024-11-28 03:07:16,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:07:16,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:07:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:07:17,043 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-28 03:07:17,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:07:17,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131314662] [2024-11-28 03:07:17,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131314662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:07:17,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:07:17,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:07:17,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424484146] [2024-11-28 03:07:17,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:07:17,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:07:17,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:07:17,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:07:17,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:07:17,046 INFO L87 Difference]: Start difference. First operand 197 states and 213 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-28 03:07:17,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:07:17,414 INFO L93 Difference]: Finished difference Result 196 states and 212 transitions. [2024-11-28 03:07:17,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:07:17,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2024-11-28 03:07:17,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:07:17,417 INFO L225 Difference]: With dead ends: 196 [2024-11-28 03:07:17,417 INFO L226 Difference]: Without dead ends: 196 [2024-11-28 03:07:17,417 INFO L434 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-28 03:07:17,418 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 3 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:07:17,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 535 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:07:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-28 03:07:17,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-11-28 03:07:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 111 states have (on average 1.90990990990991) internal successors, (212), 195 states have internal predecessors, (212), 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-28 03:07:17,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 212 transitions. [2024-11-28 03:07:17,429 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 212 transitions. Word has length 10 [2024-11-28 03:07:17,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:07:17,429 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 212 transitions. [2024-11-28 03:07:17,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-28 03:07:17,430 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 212 transitions. [2024-11-28 03:07:17,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 03:07:17,430 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:07:17,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:07:17,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:07:17,430 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:07:17,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:07:17,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924365, now seen corresponding path program 1 times [2024-11-28 03:07:17,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:07:17,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079109006] [2024-11-28 03:07:17,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:07:17,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:07:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:07:17,868 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-28 03:07:17,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:07:17,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079109006] [2024-11-28 03:07:17,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079109006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:07:17,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:07:17,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:07:17,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766777557] [2024-11-28 03:07:17,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:07:17,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:07:17,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:07:17,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:07:17,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:07:17,870 INFO L87 Difference]: Start difference. First operand 196 states and 212 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-28 03:07:18,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:07:18,239 INFO L93 Difference]: Finished difference Result 195 states and 211 transitions. [2024-11-28 03:07:18,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:07:18,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2024-11-28 03:07:18,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:07:18,242 INFO L225 Difference]: With dead ends: 195 [2024-11-28 03:07:18,242 INFO L226 Difference]: Without dead ends: 195 [2024-11-28 03:07:18,242 INFO L434 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-28 03:07:18,243 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 2 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:07:18,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 556 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:07:18,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-28 03:07:18,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-28 03:07:18,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 111 states have (on average 1.9009009009009008) internal successors, (211), 194 states have internal predecessors, (211), 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-28 03:07:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 211 transitions. [2024-11-28 03:07:18,259 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 211 transitions. Word has length 10 [2024-11-28 03:07:18,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:07:18,259 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 211 transitions. [2024-11-28 03:07:18,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-28 03:07:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 211 transitions. [2024-11-28 03:07:18,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 03:07:18,260 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:07:18,260 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:07:18,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:07:18,261 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:07:18,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:07:18,261 INFO L85 PathProgramCache]: Analyzing trace with hash 191727319, now seen corresponding path program 1 times [2024-11-28 03:07:18,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:07:18,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89604524] [2024-11-28 03:07:18,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:07:18,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:07:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:07:18,794 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-28 03:07:18,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:07:18,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89604524] [2024-11-28 03:07:18,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89604524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:07:18,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:07:18,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 03:07:18,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73178030] [2024-11-28 03:07:18,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:07:18,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:07:18,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:07:18,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:07:18,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:07:18,799 INFO L87 Difference]: Start difference. First operand 195 states and 211 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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-28 03:07:19,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:07:19,481 INFO L93 Difference]: Finished difference Result 361 states and 399 transitions. [2024-11-28 03:07:19,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:07:19,482 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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 16 [2024-11-28 03:07:19,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:07:19,483 INFO L225 Difference]: With dead ends: 361 [2024-11-28 03:07:19,484 INFO L226 Difference]: Without dead ends: 361 [2024-11-28 03:07:19,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:07:19,485 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 474 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:07:19,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 641 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 03:07:19,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-28 03:07:19,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 200. [2024-11-28 03:07:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 116 states have (on average 1.8793103448275863) internal successors, (218), 199 states have internal predecessors, (218), 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-28 03:07:19,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 218 transitions. [2024-11-28 03:07:19,500 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 218 transitions. Word has length 16 [2024-11-28 03:07:19,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:07:19,500 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 218 transitions. [2024-11-28 03:07:19,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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-28 03:07:19,500 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 218 transitions. [2024-11-28 03:07:19,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 03:07:19,501 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:07:19,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:07:19,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:07:19,501 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:07:19,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:07:19,506 INFO L85 PathProgramCache]: Analyzing trace with hash 191727320, now seen corresponding path program 1 times [2024-11-28 03:07:19,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:07:19,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055240784] [2024-11-28 03:07:19,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:07:19,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:07:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:07:20,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:07:20,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:07:20,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055240784] [2024-11-28 03:07:20,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055240784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:07:20,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:07:20,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:07:20,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111632003] [2024-11-28 03:07:20,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:07:20,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:07:20,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:07:20,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:07:20,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:07:20,387 INFO L87 Difference]: Start difference. First operand 200 states and 218 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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-28 03:07:21,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:07:21,083 INFO L93 Difference]: Finished difference Result 282 states and 313 transitions. [2024-11-28 03:07:21,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:07:21,084 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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 16 [2024-11-28 03:07:21,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:07:21,086 INFO L225 Difference]: With dead ends: 282 [2024-11-28 03:07:21,086 INFO L226 Difference]: Without dead ends: 282 [2024-11-28 03:07:21,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:07:21,087 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 478 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:07:21,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 490 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:07:21,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-28 03:07:21,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 200. [2024-11-28 03:07:21,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 116 states have (on average 1.8706896551724137) internal successors, (217), 199 states have internal predecessors, (217), 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-28 03:07:21,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 217 transitions. [2024-11-28 03:07:21,095 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 217 transitions. Word has length 16 [2024-11-28 03:07:21,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:07:21,096 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 217 transitions. [2024-11-28 03:07:21,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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-28 03:07:21,096 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 217 transitions. [2024-11-28 03:07:21,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 03:07:21,097 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:07:21,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:07:21,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:07:21,097 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:07:21,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:07:21,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1648579604, now seen corresponding path program 1 times [2024-11-28 03:07:21,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:07:21,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553451599] [2024-11-28 03:07:21,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:07:21,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:07:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:07:21,182 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-28 03:07:21,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:07:21,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553451599] [2024-11-28 03:07:21,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553451599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:07:21,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:07:21,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:07:21,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816238392] [2024-11-28 03:07:21,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:07:21,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:07:21,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:07:21,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:07:21,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:07:21,185 INFO L87 Difference]: Start difference. First operand 200 states and 217 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-28 03:07:21,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:07:21,366 INFO L93 Difference]: Finished difference Result 197 states and 214 transitions. [2024-11-28 03:07:21,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:07:21,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-28 03:07:21,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:07:21,368 INFO L225 Difference]: With dead ends: 197 [2024-11-28 03:07:21,368 INFO L226 Difference]: Without dead ends: 197 [2024-11-28 03:07:21,371 INFO L434 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-28 03:07:21,372 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 23 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:07:21,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 283 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:07:21,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-28 03:07:21,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-11-28 03:07:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 116 states have (on average 1.8448275862068966) internal successors, (214), 196 states have internal predecessors, (214), 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-28 03:07:21,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 214 transitions. [2024-11-28 03:07:21,381 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 214 transitions. Word has length 17 [2024-11-28 03:07:21,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:07:21,381 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 214 transitions. [2024-11-28 03:07:21,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-28 03:07:21,382 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 214 transitions. [2024-11-28 03:07:21,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 03:07:21,383 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:07:21,384 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:07:21,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:07:21,384 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:07:21,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:07:21,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1648579605, now seen corresponding path program 1 times [2024-11-28 03:07:21,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:07:21,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236950870] [2024-11-28 03:07:21,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:07:21,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:07:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:07:21,543 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-28 03:07:21,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:07:21,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236950870] [2024-11-28 03:07:21,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236950870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:07:21,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:07:21,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:07:21,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941732922] [2024-11-28 03:07:21,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:07:21,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:07:21,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:07:21,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:07:21,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:07:21,545 INFO L87 Difference]: Start difference. First operand 197 states and 214 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-28 03:07:21,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:07:21,726 INFO L93 Difference]: Finished difference Result 195 states and 212 transitions. [2024-11-28 03:07:21,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:07:21,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-28 03:07:21,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:07:21,728 INFO L225 Difference]: With dead ends: 195 [2024-11-28 03:07:21,728 INFO L226 Difference]: Without dead ends: 195 [2024-11-28 03:07:21,728 INFO L434 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-28 03:07:21,729 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 16 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:07:21,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 295 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:07:21,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-28 03:07:21,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-28 03:07:21,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 116 states have (on average 1.8275862068965518) internal successors, (212), 194 states have internal predecessors, (212), 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-28 03:07:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 212 transitions. [2024-11-28 03:07:21,735 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 212 transitions. Word has length 17 [2024-11-28 03:07:21,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:07:21,736 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 212 transitions. [2024-11-28 03:07:21,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-28 03:07:21,736 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 212 transitions. [2024-11-28 03:07:21,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-28 03:07:21,737 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:07:21,737 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:07:21,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:07:21,737 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:07:21,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:07:21,738 INFO L85 PathProgramCache]: Analyzing trace with hash -354432464, now seen corresponding path program 1 times [2024-11-28 03:07:21,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:07:21,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482993575] [2024-11-28 03:07:21,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:07:21,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:07:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:07:21,807 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-28 03:07:21,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:07:21,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482993575] [2024-11-28 03:07:21,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482993575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:07:21,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:07:21,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:07:21,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845503126] [2024-11-28 03:07:21,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:07:21,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:07:21,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:07:21,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:07:21,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:07:21,809 INFO L87 Difference]: Start difference. First operand 195 states and 212 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-28 03:07:22,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:07:22,190 INFO L93 Difference]: Finished difference Result 259 states and 287 transitions. [2024-11-28 03:07:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:07:22,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-11-28 03:07:22,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:07:22,192 INFO L225 Difference]: With dead ends: 259 [2024-11-28 03:07:22,192 INFO L226 Difference]: Without dead ends: 259 [2024-11-28 03:07:22,193 INFO L434 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-28 03:07:22,194 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 271 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:07:22,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 180 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:07:22,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-28 03:07:22,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 185. [2024-11-28 03:07:22,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 121 states have (on average 1.7024793388429753) internal successors, (206), 184 states have internal predecessors, (206), 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-28 03:07:22,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 206 transitions. [2024-11-28 03:07:22,206 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 206 transitions. Word has length 18 [2024-11-28 03:07:22,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:07:22,206 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 206 transitions. [2024-11-28 03:07:22,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-28 03:07:22,206 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 206 transitions. [2024-11-28 03:07:22,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-28 03:07:22,207 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:07:22,207 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:07:22,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:07:22,207 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:07:22,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:07:22,208 INFO L85 PathProgramCache]: Analyzing trace with hash -354432463, now seen corresponding path program 1 times [2024-11-28 03:07:22,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:07:22,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003797593] [2024-11-28 03:07:22,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:07:22,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:07:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:07:22,355 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-28 03:07:22,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:07:22,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003797593] [2024-11-28 03:07:22,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003797593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:07:22,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:07:22,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:07:22,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350015800] [2024-11-28 03:07:22,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:07:22,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:07:22,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:07:22,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:07:22,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:07:22,358 INFO L87 Difference]: Start difference. First operand 185 states and 206 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-28 03:07:22,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:07:22,903 INFO L93 Difference]: Finished difference Result 428 states and 485 transitions. [2024-11-28 03:07:22,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:07:22,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2024-11-28 03:07:22,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:07:22,905 INFO L225 Difference]: With dead ends: 428 [2024-11-28 03:07:22,906 INFO L226 Difference]: Without dead ends: 428 [2024-11-28 03:07:22,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:07:22,906 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 670 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:07:22,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 329 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:07:22,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-28 03:07:22,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 335. [2024-11-28 03:07:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 271 states have (on average 1.7121771217712176) internal successors, (464), 334 states have internal predecessors, (464), 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-28 03:07:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 464 transitions. [2024-11-28 03:07:22,919 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 464 transitions. Word has length 18 [2024-11-28 03:07:22,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:07:22,920 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 464 transitions. [2024-11-28 03:07:22,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-28 03:07:22,920 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 464 transitions. [2024-11-28 03:07:22,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-28 03:07:22,920 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:07:22,920 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:07:22,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:07:22,921 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:07:22,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:07:22,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1897700132, now seen corresponding path program 1 times [2024-11-28 03:07:22,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:07:22,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474167136] [2024-11-28 03:07:22,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:07:22,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:07:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:07:22,958 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-28 03:07:22,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:07:22,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474167136] [2024-11-28 03:07:22,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474167136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:07:22,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:07:22,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:07:22,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385060666] [2024-11-28 03:07:22,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:07:22,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:07:22,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:07:22,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:07:22,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:07:22,960 INFO L87 Difference]: Start difference. First operand 335 states and 464 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-28 03:07:22,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:07:22,989 INFO L93 Difference]: Finished difference Result 411 states and 544 transitions. [2024-11-28 03:07:22,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:07:22,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-28 03:07:22,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:07:22,992 INFO L225 Difference]: With dead ends: 411 [2024-11-28 03:07:22,992 INFO L226 Difference]: Without dead ends: 411 [2024-11-28 03:07:22,992 INFO L434 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-28 03:07:22,992 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 171 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:07:22,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 304 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:07:22,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-28 03:07:23,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 377. [2024-11-28 03:07:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 313 states have (on average 1.7380191693290734) internal successors, (544), 376 states have internal predecessors, (544), 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-28 03:07:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 544 transitions. [2024-11-28 03:07:23,004 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 544 transitions. Word has length 19 [2024-11-28 03:07:23,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:07:23,004 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 544 transitions. [2024-11-28 03:07:23,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-28 03:07:23,004 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 544 transitions. [2024-11-28 03:07:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 03:07:23,005 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:07:23,005 INFO L218 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-28 03:07:23,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:07:23,005 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:07:23,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:07:23,006 INFO L85 PathProgramCache]: Analyzing trace with hash -116033059, now seen corresponding path program 1 times [2024-11-28 03:07:23,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:07:23,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293684986] [2024-11-28 03:07:23,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:07:23,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:07:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:07:23,189 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-28 03:07:23,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:07:23,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293684986] [2024-11-28 03:07:23,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293684986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:07:23,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:07:23,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 03:07:23,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012610507] [2024-11-28 03:07:23,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:07:23,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:07:23,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:07:23,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:07:23,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:07:23,191 INFO L87 Difference]: Start difference. First operand 377 states and 544 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-28 03:07:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:07:23,646 INFO L93 Difference]: Finished difference Result 511 states and 745 transitions. [2024-11-28 03:07:23,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:07:23,646 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-28 03:07:23,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:07:23,649 INFO L225 Difference]: With dead ends: 511 [2024-11-28 03:07:23,649 INFO L226 Difference]: Without dead ends: 511 [2024-11-28 03:07:23,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:07:23,650 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 179 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:07:23,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 580 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:07:23,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-28 03:07:23,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 376. [2024-11-28 03:07:23,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 313 states have (on average 1.7348242811501597) internal successors, (543), 375 states have internal predecessors, (543), 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-28 03:07:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 543 transitions. [2024-11-28 03:07:23,668 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 543 transitions. Word has length 20 [2024-11-28 03:07:23,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:07:23,669 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 543 transitions. [2024-11-28 03:07:23,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-28 03:07:23,669 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 543 transitions. [2024-11-28 03:07:23,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 03:07:23,670 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:07:23,671 INFO L218 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-28 03:07:23,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:07:23,671 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:07:23,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:07:23,672 INFO L85 PathProgramCache]: Analyzing trace with hash -116033058, now seen corresponding path program 1 times [2024-11-28 03:07:23,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:07:23,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394884847] [2024-11-28 03:07:23,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:07:23,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:07:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:07:24,018 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-28 03:07:24,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:07:24,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394884847] [2024-11-28 03:07:24,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394884847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:07:24,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:07:24,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 03:07:24,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366090704] [2024-11-28 03:07:24,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:07:24,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:07:24,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:07:24,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:07:24,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:07:24,021 INFO L87 Difference]: Start difference. First operand 376 states and 543 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-28 03:07:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:07:24,833 INFO L93 Difference]: Finished difference Result 510 states and 744 transitions. [2024-11-28 03:07:24,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:07:24,833 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-28 03:07:24,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:07:24,836 INFO L225 Difference]: With dead ends: 510 [2024-11-28 03:07:24,836 INFO L226 Difference]: Without dead ends: 510 [2024-11-28 03:07:24,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:07:24,837 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 173 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:07:24,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 721 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 03:07:24,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-11-28 03:07:24,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 375. [2024-11-28 03:07:24,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 313 states have (on average 1.731629392971246) internal successors, (542), 374 states have internal predecessors, (542), 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-28 03:07:24,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 542 transitions. [2024-11-28 03:07:24,852 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 542 transitions. Word has length 20 [2024-11-28 03:07:24,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:07:24,852 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 542 transitions. [2024-11-28 03:07:24,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-28 03:07:24,852 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 542 transitions. [2024-11-28 03:07:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-28 03:07:24,853 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:07:24,853 INFO L218 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] [2024-11-28 03:07:24,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:07:24,855 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:07:24,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:07:24,856 INFO L85 PathProgramCache]: Analyzing trace with hash -973202430, now seen corresponding path program 1 times [2024-11-28 03:07:24,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:07:24,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956385969] [2024-11-28 03:07:24,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:07:24,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:07:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:07:24,901 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-28 03:07:24,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:07:24,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956385969] [2024-11-28 03:07:24,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956385969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:07:24,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:07:24,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:07:24,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349178229] [2024-11-28 03:07:24,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:07:24,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:07:24,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:07:24,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:07:24,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:07:24,903 INFO L87 Difference]: Start difference. First operand 375 states and 542 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-28 03:07:24,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:07:24,917 INFO L93 Difference]: Finished difference Result 379 states and 546 transitions. [2024-11-28 03:07:24,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:07:24,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2024-11-28 03:07:24,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:07:24,920 INFO L225 Difference]: With dead ends: 379 [2024-11-28 03:07:24,920 INFO L226 Difference]: Without dead ends: 379 [2024-11-28 03:07:24,923 INFO L434 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-28 03:07:24,927 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:07:24,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:07:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-28 03:07:24,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2024-11-28 03:07:24,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 317 states have (on average 1.722397476340694) internal successors, (546), 378 states have internal predecessors, (546), 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-28 03:07:24,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 546 transitions. [2024-11-28 03:07:24,941 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 546 transitions. Word has length 24 [2024-11-28 03:07:24,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:07:24,941 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 546 transitions. [2024-11-28 03:07:24,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-28 03:07:24,942 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 546 transitions. [2024-11-28 03:07:24,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 03:07:24,945 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:07:24,946 INFO L218 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-28 03:07:24,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 03:07:24,946 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:07:24,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:07:24,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1582542525, now seen corresponding path program 1 times [2024-11-28 03:07:24,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:07:24,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854616081] [2024-11-28 03:07:24,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:07:24,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:07:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:07:24,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:07:24,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:07:24,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854616081] [2024-11-28 03:07:24,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854616081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:07:24,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:07:24,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:07:24,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18809427] [2024-11-28 03:07:24,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:07:24,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:07:24,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:07:24,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:07:24,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:07:24,997 INFO L87 Difference]: Start difference. First operand 379 states and 546 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-28 03:07:25,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:07:25,009 INFO L93 Difference]: Finished difference Result 382 states and 549 transitions. [2024-11-28 03:07:25,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:07:25,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-28 03:07:25,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:07:25,012 INFO L225 Difference]: With dead ends: 382 [2024-11-28 03:07:25,012 INFO L226 Difference]: Without dead ends: 382 [2024-11-28 03:07:25,012 INFO L434 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-28 03:07:25,013 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:07:25,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:07:25,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-28 03:07:25,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2024-11-28 03:07:25,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 320 states have (on average 1.715625) internal successors, (549), 381 states have internal predecessors, (549), 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-28 03:07:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 549 transitions. [2024-11-28 03:07:25,027 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 549 transitions. Word has length 26 [2024-11-28 03:07:25,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:07:25,027 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 549 transitions. [2024-11-28 03:07:25,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-28 03:07:25,028 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 549 transitions. [2024-11-28 03:07:25,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 03:07:25,029 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:07:25,029 INFO L218 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-28 03:07:25,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 03:07:25,030 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:07:25,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:07:25,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1103340637, now seen corresponding path program 1 times [2024-11-28 03:07:25,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:07:25,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931375896] [2024-11-28 03:07:25,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:07:25,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:07:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:07:25,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-28 03:07:25,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:07:25,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931375896] [2024-11-28 03:07:25,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931375896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:07:25,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:07:25,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:07:25,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091553977] [2024-11-28 03:07:25,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:07:25,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:07:25,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:07:25,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:07:25,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:07:25,103 INFO L87 Difference]: Start difference. First operand 382 states and 549 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-28 03:07:25,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:07:25,134 INFO L93 Difference]: Finished difference Result 379 states and 530 transitions. [2024-11-28 03:07:25,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:07:25,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-28 03:07:25,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:07:25,136 INFO L225 Difference]: With dead ends: 379 [2024-11-28 03:07:25,137 INFO L226 Difference]: Without dead ends: 379 [2024-11-28 03:07:25,137 INFO L434 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-28 03:07:25,137 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 5 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:07:25,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 365 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:07:25,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-28 03:07:25,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 371. [2024-11-28 03:07:25,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 309 states have (on average 1.6990291262135921) internal successors, (525), 370 states have internal predecessors, (525), 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-28 03:07:25,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 525 transitions. [2024-11-28 03:07:25,151 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 525 transitions. Word has length 26 [2024-11-28 03:07:25,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:07:25,153 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 525 transitions. [2024-11-28 03:07:25,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-28 03:07:25,153 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 525 transitions. [2024-11-28 03:07:25,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 03:07:25,154 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:07:25,154 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:07:25,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 03:07:25,156 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:07:25,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:07:25,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1245483444, now seen corresponding path program 1 times [2024-11-28 03:07:25,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:07:25,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603233623] [2024-11-28 03:07:25,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:07:25,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:07:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:07:25,697 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:07:25,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:07:25,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603233623] [2024-11-28 03:07:25,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603233623] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:07:25,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813608614] [2024-11-28 03:07:25,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:07:25,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:07:25,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:07:25,703 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:07:25,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:07:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:07:25,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-28 03:07:25,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:07:25,919 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-28 03:07:25,957 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:07:25,958 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-28 03:07:25,981 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-28 03:07:26,105 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:07:26,106 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 31 treesize of output 32 [2024-11-28 03:07:26,148 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:07:26,149 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-28 03:07:26,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 30 treesize of output 23 [2024-11-28 03:07:26,379 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:07:26,379 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-28 03:07:26,425 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-11-28 03:07:26,425 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 1 case distinctions, treesize of input 18 treesize of output 20 [2024-11-28 03:07:26,503 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-28 03:07:26,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:07:26,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:07:26,657 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_517) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 03:07:26,677 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_516))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_517)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 03:07:26,696 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-28 03:07:26,696 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 33 treesize of output 32 [2024-11-28 03:07:26,706 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_516))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_517)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) is different from false [2024-11-28 03:07:26,717 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_516))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_517)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)))) is different from false [2024-11-28 03:07:27,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:07:27,057 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 69 treesize of output 50 [2024-11-28 03:07:27,063 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:07:27,068 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 580 treesize of output 454 [2024-11-28 03:07:27,089 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:07:27,089 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 13 treesize of output 12 [2024-11-28 03:07:27,096 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 20 treesize of output 12 [2024-11-28 03:07:27,099 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-28 03:07:27,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-28 03:07:27,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813608614] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:07:27,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:07:27,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 13] total 26 [2024-11-28 03:07:27,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137938440] [2024-11-28 03:07:27,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:07:27,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-28 03:07:27,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:07:27,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-28 03:07:27,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=411, Unknown=18, NotChecked=180, Total=702 [2024-11-28 03:07:27,144 INFO L87 Difference]: Start difference. First operand 371 states and 525 transitions. Second operand has 27 states, 26 states have (on average 2.769230769230769) internal successors, (72), 27 states have internal predecessors, (72), 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-28 03:07:28,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:07:28,838 INFO L93 Difference]: Finished difference Result 597 states and 822 transitions. [2024-11-28 03:07:28,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:07:28,839 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.769230769230769) internal successors, (72), 27 states have internal predecessors, (72), 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-28 03:07:28,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:07:28,842 INFO L225 Difference]: With dead ends: 597 [2024-11-28 03:07:28,842 INFO L226 Difference]: Without dead ends: 597 [2024-11-28 03:07:28,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=162, Invalid=592, Unknown=18, NotChecked=220, Total=992 [2024-11-28 03:07:28,843 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 629 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 2122 SdHoareTripleChecker+Invalid, 2582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1159 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:07:28,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 2122 Invalid, 2582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1395 Invalid, 0 Unknown, 1159 Unchecked, 1.4s Time] [2024-11-28 03:07:28,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-11-28 03:07:28,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 370. [2024-11-28 03:07:28,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 309 states have (on average 1.6957928802588997) internal successors, (524), 369 states have internal predecessors, (524), 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-28 03:07:28,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 524 transitions. [2024-11-28 03:07:28,857 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 524 transitions. Word has length 26 [2024-11-28 03:07:28,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:07:28,857 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 524 transitions. [2024-11-28 03:07:28,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.769230769230769) internal successors, (72), 27 states have internal predecessors, (72), 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-28 03:07:28,858 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 524 transitions. [2024-11-28 03:07:28,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 03:07:28,858 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:07:28,858 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:07:28,871 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 03:07:29,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-28 03:07:29,060 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:07:29,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:07:29,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1245483443, now seen corresponding path program 1 times [2024-11-28 03:07:29,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:07:29,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698602281] [2024-11-28 03:07:29,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:07:29,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:07:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:07:29,781 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:07:29,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:07:29,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698602281] [2024-11-28 03:07:29,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698602281] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:07:29,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497148903] [2024-11-28 03:07:29,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:07:29,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:07:29,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:07:29,785 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:07:29,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:07:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:07:29,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-28 03:07:29,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:07:29,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:07:30,028 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:07:30,028 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-28 03:07:30,074 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-28 03:07:30,079 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-28 03:07:30,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:07:30,238 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 34 [2024-11-28 03:07:30,247 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-28 03:07:30,311 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:07:30,311 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-28 03:07:30,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-28 03:07:30,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 03:07:30,660 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:07:30,660 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 70 treesize of output 61 [2024-11-28 03:07:30,667 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-28 03:07:30,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:07:30,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-28 03:07:30,767 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 03:07:30,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-28 03:07:30,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 25 treesize of output 13 [2024-11-28 03:07:30,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 03:07:30,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:07:30,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:07:31,524 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0))) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_616 Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_612))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (or (< .cse0 0) (< 0 (+ (select (select (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_613) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse0 v_ArrVal_616))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) 1))))))) (forall ((v_ArrVal_612 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_612))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (or (< .cse4 0) (forall ((v_ArrVal_613 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_616 Int)) (or (forall ((v_ArrVal_617 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_613))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (<= (+ (select (select (store .cse5 .cse6 (store (select .cse5 .cse6) .cse4 v_ArrVal_616)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_617) (select (select (store .cse7 .cse6 v_ArrVal_615) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0)))))))))) is different from false [2024-11-28 03:07:31,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:07:31,583 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 277 treesize of output 281 [2024-11-28 03:07:31,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:07:31,635 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 253 treesize of output 271 [2024-11-28 03:07:31,975 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (or (forall ((v_prenex_8 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_8) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 0)) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_615 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_9))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_615)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem9#1.base|))) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_616 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_612))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (or (< .cse2 0) (< 0 (+ (select (select (let ((.cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_613) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse2 v_ArrVal_616))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 1)))))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_11 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_8))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (or (< .cse5 0) (< (select (select (let ((.cse7 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_9) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse5 v_prenex_11))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| 1)))))))) is different from false [2024-11-28 03:07:32,047 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (or (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_615 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_9))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_615)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (forall ((v_prenex_8 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_8) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) 0))) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_616 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_612))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (or (< .cse2 0) (< 0 (+ (select (select (let ((.cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_613) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse2 v_ArrVal_616))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) 1)))))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_11 Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_8))) (let ((.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (or (< (select (select (let ((.cse6 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_9) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_prenex_11))) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) 1)) (< .cse7 0))))))) is different from false [2024-11-28 03:07:33,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:07:33,934 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 533 treesize of output 444 [2024-11-28 03:07:34,252 INFO L349 Elim1Store]: treesize reduction 57, result has 61.5 percent of original size [2024-11-28 03:07:34,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 500 treesize of output 409 [2024-11-28 03:07:34,328 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 03:07:34,329 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 2 case distinctions, treesize of input 7558 treesize of output 7538 [2024-11-28 03:07:34,433 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 773 treesize of output 733 [2024-11-28 03:07:34,463 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 733 treesize of output 673 [2024-11-28 03:07:34,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:07:34,803 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 52254 treesize of output 48751 [2024-11-28 03:07:35,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 2709 treesize of output 2613 [2024-11-28 03:07:35,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2623 treesize of output 2543 [2024-11-28 03:07:35,592 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 2681 treesize of output 2557 [2024-11-28 03:07:35,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:07:35,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2548 treesize of output 2588 [2024-11-28 03:07:36,194 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 2581 treesize of output 2457 [2024-11-28 03:07:36,308 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 3323 treesize of output 2963 [2024-11-28 03:07:36,565 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 2031 treesize of output 2023 [2024-11-28 03:07:36,687 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 2167 treesize of output 2047 [2024-11-28 03:07:36,814 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 2111 treesize of output 2047 [2024-11-28 03:07:36,938 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 2047 treesize of output 2043 [2024-11-28 03:07:37,092 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 2119 treesize of output 1995 [2024-11-28 03:08:26,056 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 03:08:26,069 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 43 treesize of output 35 [2024-11-28 03:08:26,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-28 03:08:26,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-28 03:08:26,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497148903] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:08:26,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:08:26,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 14] total 34 [2024-11-28 03:08:26,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919442535] [2024-11-28 03:08:26,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:08:26,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-28 03:08:26,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:08:26,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-28 03:08:26,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=860, Unknown=11, NotChecked=186, Total=1190 [2024-11-28 03:08:26,188 INFO L87 Difference]: Start difference. First operand 370 states and 524 transitions. Second operand has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 35 states have internal predecessors, (75), 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-28 03:08:30,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:08:30,370 INFO L93 Difference]: Finished difference Result 596 states and 821 transitions. [2024-11-28 03:08:30,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:08:30,371 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 35 states have internal predecessors, (75), 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-28 03:08:30,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:08:30,373 INFO L225 Difference]: With dead ends: 596 [2024-11-28 03:08:30,373 INFO L226 Difference]: Without dead ends: 596 [2024-11-28 03:08:30,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=225, Invalid=1108, Unknown=11, NotChecked=216, Total=1560 [2024-11-28 03:08:30,375 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 855 mSDsluCounter, 1932 mSDsCounter, 0 mSdLazyCounter, 1972 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 2064 SdHoareTripleChecker+Invalid, 2892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 879 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:08:30,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 2064 Invalid, 2892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1972 Invalid, 0 Unknown, 879 Unchecked, 3.7s Time] [2024-11-28 03:08:30,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-11-28 03:08:30,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 364. [2024-11-28 03:08:30,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 304 states have (on average 1.700657894736842) internal successors, (517), 363 states have internal predecessors, (517), 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-28 03:08:30,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 517 transitions. [2024-11-28 03:08:30,387 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 517 transitions. Word has length 26 [2024-11-28 03:08:30,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:08:30,387 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 517 transitions. [2024-11-28 03:08:30,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 35 states have internal predecessors, (75), 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-28 03:08:30,387 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 517 transitions. [2024-11-28 03:08:30,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 03:08:30,388 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:08:30,388 INFO L218 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-28 03:08:30,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 03:08:30,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:08:30,589 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:08:30,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:08:30,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1311422610, now seen corresponding path program 1 times [2024-11-28 03:08:30,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:08:30,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735086825] [2024-11-28 03:08:30,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:30,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:08:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:30,660 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-28 03:08:30,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:08:30,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735086825] [2024-11-28 03:08:30,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735086825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:08:30,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:08:30,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:08:30,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462851042] [2024-11-28 03:08:30,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:08:30,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:08:30,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:08:30,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:08:30,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:08:30,663 INFO L87 Difference]: Start difference. First operand 364 states and 517 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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-28 03:08:30,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:08:30,817 INFO L93 Difference]: Finished difference Result 359 states and 512 transitions. [2024-11-28 03:08:30,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:08:30,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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-28 03:08:30,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:08:30,819 INFO L225 Difference]: With dead ends: 359 [2024-11-28 03:08:30,819 INFO L226 Difference]: Without dead ends: 359 [2024-11-28 03:08:30,819 INFO L434 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-28 03:08:30,820 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 8 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:08:30,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 267 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:08:30,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-28 03:08:30,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-11-28 03:08:30,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 304 states have (on average 1.6842105263157894) internal successors, (512), 358 states have internal predecessors, (512), 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-28 03:08:30,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 512 transitions. [2024-11-28 03:08:30,829 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 512 transitions. Word has length 28 [2024-11-28 03:08:30,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:08:30,829 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 512 transitions. [2024-11-28 03:08:30,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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-28 03:08:30,829 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 512 transitions. [2024-11-28 03:08:30,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 03:08:30,830 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:08:30,830 INFO L218 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-28 03:08:30,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 03:08:30,830 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:08:30,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:08:30,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1311422609, now seen corresponding path program 1 times [2024-11-28 03:08:30,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:08:30,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447672722] [2024-11-28 03:08:30,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:30,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:08:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:30,909 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-28 03:08:30,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:08:30,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447672722] [2024-11-28 03:08:30,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447672722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:08:30,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:08:30,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:08:30,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356606731] [2024-11-28 03:08:30,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:08:30,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:08:30,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:08:30,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:08:30,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:08:30,912 INFO L87 Difference]: Start difference. First operand 359 states and 512 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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-28 03:08:31,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:08:31,071 INFO L93 Difference]: Finished difference Result 357 states and 510 transitions. [2024-11-28 03:08:31,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:08:31,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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-28 03:08:31,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:08:31,074 INFO L225 Difference]: With dead ends: 357 [2024-11-28 03:08:31,074 INFO L226 Difference]: Without dead ends: 357 [2024-11-28 03:08:31,074 INFO L434 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-28 03:08:31,075 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 5 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:08:31,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 265 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:08:31,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-28 03:08:31,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2024-11-28 03:08:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 304 states have (on average 1.6776315789473684) internal successors, (510), 356 states have internal predecessors, (510), 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-28 03:08:31,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 510 transitions. [2024-11-28 03:08:31,084 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 510 transitions. Word has length 28 [2024-11-28 03:08:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:08:31,084 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 510 transitions. [2024-11-28 03:08:31,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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-28 03:08:31,085 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 510 transitions. [2024-11-28 03:08:31,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 03:08:31,085 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:08:31,085 INFO L218 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-28 03:08:31,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 03:08:31,086 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:08:31,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:08:31,087 INFO L85 PathProgramCache]: Analyzing trace with hash -807259654, now seen corresponding path program 1 times [2024-11-28 03:08:31,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:08:31,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376802182] [2024-11-28 03:08:31,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:31,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:08:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:08:31,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:08:31,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376802182] [2024-11-28 03:08:31,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376802182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:08:31,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:08:31,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:08:31,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43826488] [2024-11-28 03:08:31,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:08:31,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:08:31,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:08:31,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:08:31,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:08:31,575 INFO L87 Difference]: Start difference. First operand 357 states and 510 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 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-28 03:08:32,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:08:32,349 INFO L93 Difference]: Finished difference Result 571 states and 751 transitions. [2024-11-28 03:08:32,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 03:08:32,349 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 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-28 03:08:32,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:08:32,351 INFO L225 Difference]: With dead ends: 571 [2024-11-28 03:08:32,351 INFO L226 Difference]: Without dead ends: 571 [2024-11-28 03:08:32,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-28 03:08:32,353 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 344 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:08:32,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1078 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 03:08:32,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2024-11-28 03:08:32,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 376. [2024-11-28 03:08:32,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 323 states have (on average 1.6563467492260062) internal successors, (535), 375 states have internal predecessors, (535), 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-28 03:08:32,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 535 transitions. [2024-11-28 03:08:32,363 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 535 transitions. Word has length 28 [2024-11-28 03:08:32,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:08:32,363 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 535 transitions. [2024-11-28 03:08:32,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 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-28 03:08:32,363 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 535 transitions. [2024-11-28 03:08:32,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 03:08:32,363 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:08:32,364 INFO L218 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-28 03:08:32,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 03:08:32,364 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:08:32,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:08:32,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1883159683, now seen corresponding path program 1 times [2024-11-28 03:08:32,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:08:32,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024737580] [2024-11-28 03:08:32,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:32,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:08:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:32,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:08:32,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:08:32,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024737580] [2024-11-28 03:08:32,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024737580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:08:32,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:08:32,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:08:32,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134671579] [2024-11-28 03:08:32,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:08:32,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:08:32,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:08:32,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:08:32,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:08:32,484 INFO L87 Difference]: Start difference. First operand 376 states and 535 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-28 03:08:32,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:08:32,748 INFO L93 Difference]: Finished difference Result 392 states and 557 transitions. [2024-11-28 03:08:32,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:08:32,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-28 03:08:32,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:08:32,751 INFO L225 Difference]: With dead ends: 392 [2024-11-28 03:08:32,751 INFO L226 Difference]: Without dead ends: 392 [2024-11-28 03:08:32,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-28 03:08:32,752 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 4 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:08:32,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 520 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:08:32,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-28 03:08:32,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2024-11-28 03:08:32,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 335 states have (on average 1.6417910447761195) internal successors, (550), 387 states have internal predecessors, (550), 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-28 03:08:32,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 550 transitions. [2024-11-28 03:08:32,765 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 550 transitions. Word has length 28 [2024-11-28 03:08:32,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:08:32,765 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 550 transitions. [2024-11-28 03:08:32,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-28 03:08:32,765 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 550 transitions. [2024-11-28 03:08:32,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 03:08:32,766 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:08:32,766 INFO L218 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-28 03:08:32,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 03:08:32,766 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:08:32,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:08:32,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1883344381, now seen corresponding path program 1 times [2024-11-28 03:08:32,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:08:32,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20278297] [2024-11-28 03:08:32,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:32,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:08:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:08:33,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:08:33,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20278297] [2024-11-28 03:08:33,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20278297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:08:33,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:08:33,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:08:33,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643299010] [2024-11-28 03:08:33,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:08:33,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:08:33,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:08:33,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:08:33,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:08:33,140 INFO L87 Difference]: Start difference. First operand 388 states and 550 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 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-28 03:08:33,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:08:33,884 INFO L93 Difference]: Finished difference Result 587 states and 770 transitions. [2024-11-28 03:08:33,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:08:33,884 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 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-28 03:08:33,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:08:33,886 INFO L225 Difference]: With dead ends: 587 [2024-11-28 03:08:33,886 INFO L226 Difference]: Without dead ends: 587 [2024-11-28 03:08:33,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-11-28 03:08:33,887 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 435 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:08:33,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1070 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 03:08:33,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2024-11-28 03:08:33,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 437. [2024-11-28 03:08:33,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 384 states have (on average 1.6458333333333333) internal successors, (632), 436 states have internal predecessors, (632), 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-28 03:08:33,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 632 transitions. [2024-11-28 03:08:33,897 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 632 transitions. Word has length 28 [2024-11-28 03:08:33,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:08:33,898 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 632 transitions. [2024-11-28 03:08:33,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 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-28 03:08:33,898 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 632 transitions. [2024-11-28 03:08:33,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 03:08:33,898 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:08:33,898 INFO L218 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-28 03:08:33,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 03:08:33,899 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:08:33,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:08:33,899 INFO L85 PathProgramCache]: Analyzing trace with hash -546036285, now seen corresponding path program 1 times [2024-11-28 03:08:33,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:08:33,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986871138] [2024-11-28 03:08:33,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:33,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:08:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:34,166 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-28 03:08:34,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:08:34,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986871138] [2024-11-28 03:08:34,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986871138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:08:34,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:08:34,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:08:34,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134770331] [2024-11-28 03:08:34,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:08:34,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:08:34,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:08:34,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:08:34,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:08:34,168 INFO L87 Difference]: Start difference. First operand 437 states and 632 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 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-28 03:08:34,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:08:34,898 INFO L93 Difference]: Finished difference Result 657 states and 921 transitions. [2024-11-28 03:08:34,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:08:34,898 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 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-28 03:08:34,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:08:34,901 INFO L225 Difference]: With dead ends: 657 [2024-11-28 03:08:34,901 INFO L226 Difference]: Without dead ends: 657 [2024-11-28 03:08:34,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-11-28 03:08:34,901 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 696 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:08:34,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 899 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 03:08:34,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-11-28 03:08:34,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 446. [2024-11-28 03:08:34,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 393 states have (on average 1.6361323155216285) internal successors, (643), 445 states have internal predecessors, (643), 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-28 03:08:34,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 643 transitions. [2024-11-28 03:08:34,918 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 643 transitions. Word has length 28 [2024-11-28 03:08:34,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:08:34,919 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 643 transitions. [2024-11-28 03:08:34,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 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-28 03:08:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 643 transitions. [2024-11-28 03:08:34,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 03:08:34,920 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:08:34,920 INFO L218 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-28 03:08:34,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-28 03:08:34,920 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:08:34,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:08:34,921 INFO L85 PathProgramCache]: Analyzing trace with hash -546036284, now seen corresponding path program 1 times [2024-11-28 03:08:34,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:08:34,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961777158] [2024-11-28 03:08:34,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:34,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:08:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:35,262 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-28 03:08:35,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:08:35,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961777158] [2024-11-28 03:08:35,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961777158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:08:35,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:08:35,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:08:35,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152367024] [2024-11-28 03:08:35,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:08:35,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:08:35,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:08:35,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:08:35,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:08:35,264 INFO L87 Difference]: Start difference. First operand 446 states and 643 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 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-28 03:08:36,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:08:36,141 INFO L93 Difference]: Finished difference Result 654 states and 918 transitions. [2024-11-28 03:08:36,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:08:36,142 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 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-28 03:08:36,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:08:36,146 INFO L225 Difference]: With dead ends: 654 [2024-11-28 03:08:36,146 INFO L226 Difference]: Without dead ends: 654 [2024-11-28 03:08:36,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:08:36,147 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 405 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:08:36,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 574 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 03:08:36,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2024-11-28 03:08:36,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 446. [2024-11-28 03:08:36,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 393 states have (on average 1.633587786259542) internal successors, (642), 445 states have internal predecessors, (642), 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-28 03:08:36,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 642 transitions. [2024-11-28 03:08:36,164 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 642 transitions. Word has length 28 [2024-11-28 03:08:36,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:08:36,164 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 642 transitions. [2024-11-28 03:08:36,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 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-28 03:08:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 642 transitions. [2024-11-28 03:08:36,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 03:08:36,165 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:08:36,165 INFO L218 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] [2024-11-28 03:08:36,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 03:08:36,165 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:08:36,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:08:36,166 INFO L85 PathProgramCache]: Analyzing trace with hash 579151448, now seen corresponding path program 1 times [2024-11-28 03:08:36,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:08:36,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142561894] [2024-11-28 03:08:36,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:36,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:08:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:36,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:08:36,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:08:36,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142561894] [2024-11-28 03:08:36,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142561894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:08:36,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:08:36,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 03:08:36,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2692676] [2024-11-28 03:08:36,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:08:36,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 03:08:36,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:08:36,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 03:08:36,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:08:36,625 INFO L87 Difference]: Start difference. First operand 446 states and 642 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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-28 03:08:37,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:08:37,272 INFO L93 Difference]: Finished difference Result 568 states and 782 transitions. [2024-11-28 03:08:37,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:08:37,273 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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 30 [2024-11-28 03:08:37,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:08:37,274 INFO L225 Difference]: With dead ends: 568 [2024-11-28 03:08:37,274 INFO L226 Difference]: Without dead ends: 568 [2024-11-28 03:08:37,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2024-11-28 03:08:37,275 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 416 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:08:37,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 671 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:08:37,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-28 03:08:37,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 400. [2024-11-28 03:08:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 347 states have (on average 1.6195965417867435) internal successors, (562), 399 states have internal predecessors, (562), 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-28 03:08:37,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 562 transitions. [2024-11-28 03:08:37,285 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 562 transitions. Word has length 30 [2024-11-28 03:08:37,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:08:37,286 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 562 transitions. [2024-11-28 03:08:37,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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-28 03:08:37,286 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 562 transitions. [2024-11-28 03:08:37,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 03:08:37,286 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:08:37,287 INFO L218 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-28 03:08:37,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 03:08:37,287 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:08:37,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:08:37,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1568332822, now seen corresponding path program 1 times [2024-11-28 03:08:37,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:08:37,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367018515] [2024-11-28 03:08:37,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:37,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:08:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:37,421 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-28 03:08:37,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:08:37,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367018515] [2024-11-28 03:08:37,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367018515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:08:37,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:08:37,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:08:37,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186379482] [2024-11-28 03:08:37,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:08:37,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:08:37,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:08:37,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:08:37,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:08:37,423 INFO L87 Difference]: Start difference. First operand 400 states and 562 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 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-28 03:08:37,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:08:37,663 INFO L93 Difference]: Finished difference Result 397 states and 559 transitions. [2024-11-28 03:08:37,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:08:37,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 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-28 03:08:37,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:08:37,666 INFO L225 Difference]: With dead ends: 397 [2024-11-28 03:08:37,666 INFO L226 Difference]: Without dead ends: 397 [2024-11-28 03:08:37,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:08:37,666 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 7 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:08:37,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 330 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:08:37,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-28 03:08:37,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2024-11-28 03:08:37,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 347 states have (on average 1.6109510086455332) internal successors, (559), 396 states have internal predecessors, (559), 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-28 03:08:37,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 559 transitions. [2024-11-28 03:08:37,675 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 559 transitions. Word has length 31 [2024-11-28 03:08:37,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:08:37,675 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 559 transitions. [2024-11-28 03:08:37,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 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-28 03:08:37,676 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 559 transitions. [2024-11-28 03:08:37,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 03:08:37,676 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:08:37,676 INFO L218 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-28 03:08:37,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-28 03:08:37,677 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:08:37,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:08:37,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1925560158, now seen corresponding path program 1 times [2024-11-28 03:08:37,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:08:37,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019558040] [2024-11-28 03:08:37,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:37,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:08:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:37,768 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-28 03:08:37,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:08:37,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019558040] [2024-11-28 03:08:37,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019558040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:08:37,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:08:37,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:08:37,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571925605] [2024-11-28 03:08:37,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:08:37,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:08:37,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:08:37,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:08:37,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:08:37,770 INFO L87 Difference]: Start difference. First operand 397 states and 559 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-28 03:08:38,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:08:38,068 INFO L93 Difference]: Finished difference Result 396 states and 555 transitions. [2024-11-28 03:08:38,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:08:38,069 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-28 03:08:38,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:08:38,070 INFO L225 Difference]: With dead ends: 396 [2024-11-28 03:08:38,071 INFO L226 Difference]: Without dead ends: 396 [2024-11-28 03:08:38,071 INFO L434 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-28 03:08:38,071 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 17 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:08:38,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 400 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:08:38,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-28 03:08:38,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-28 03:08:38,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 347 states have (on average 1.5994236311239194) internal successors, (555), 395 states have internal predecessors, (555), 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-28 03:08:38,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 555 transitions. [2024-11-28 03:08:38,085 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 555 transitions. Word has length 31 [2024-11-28 03:08:38,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:08:38,085 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 555 transitions. [2024-11-28 03:08:38,085 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-28 03:08:38,085 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 555 transitions. [2024-11-28 03:08:38,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 03:08:38,086 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:08:38,086 INFO L218 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-28 03:08:38,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-28 03:08:38,086 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:08:38,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:08:38,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1925560157, now seen corresponding path program 1 times [2024-11-28 03:08:38,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:08:38,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558228249] [2024-11-28 03:08:38,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:38,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:08:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:38,207 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-28 03:08:38,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:08:38,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558228249] [2024-11-28 03:08:38,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558228249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:08:38,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:08:38,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:08:38,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674454442] [2024-11-28 03:08:38,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:08:38,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:08:38,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:08:38,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:08:38,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:08:38,209 INFO L87 Difference]: Start difference. First operand 396 states and 555 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-28 03:08:38,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:08:38,594 INFO L93 Difference]: Finished difference Result 395 states and 551 transitions. [2024-11-28 03:08:38,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:08:38,595 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-28 03:08:38,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:08:38,596 INFO L225 Difference]: With dead ends: 395 [2024-11-28 03:08:38,596 INFO L226 Difference]: Without dead ends: 395 [2024-11-28 03:08:38,597 INFO L434 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-28 03:08:38,597 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 17 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:08:38,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 396 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:08:38,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-28 03:08:38,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-11-28 03:08:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 347 states have (on average 1.5878962536023056) internal successors, (551), 394 states have internal predecessors, (551), 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-28 03:08:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 551 transitions. [2024-11-28 03:08:38,608 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 551 transitions. Word has length 31 [2024-11-28 03:08:38,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:08:38,609 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 551 transitions. [2024-11-28 03:08:38,609 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-28 03:08:38,609 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 551 transitions. [2024-11-28 03:08:38,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 03:08:38,609 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:08:38,609 INFO L218 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-28 03:08:38,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 03:08:38,610 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:08:38,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:08:38,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1925557405, now seen corresponding path program 1 times [2024-11-28 03:08:38,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:08:38,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094032775] [2024-11-28 03:08:38,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:38,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:08:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:38,908 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-28 03:08:38,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:08:38,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094032775] [2024-11-28 03:08:38,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094032775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:08:38,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:08:38,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:08:38,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495826283] [2024-11-28 03:08:38,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:08:38,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:08:38,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:08:38,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:08:38,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:08:38,910 INFO L87 Difference]: Start difference. First operand 395 states and 551 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 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-28 03:08:39,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:08:39,566 INFO L93 Difference]: Finished difference Result 557 states and 763 transitions. [2024-11-28 03:08:39,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:08:39,567 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 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-28 03:08:39,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:08:39,569 INFO L225 Difference]: With dead ends: 557 [2024-11-28 03:08:39,570 INFO L226 Difference]: Without dead ends: 557 [2024-11-28 03:08:39,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-28 03:08:39,570 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 398 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:08:39,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 771 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:08:39,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-28 03:08:39,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 398. [2024-11-28 03:08:39,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 350 states have (on average 1.5857142857142856) internal successors, (555), 397 states have internal predecessors, (555), 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-28 03:08:39,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 555 transitions. [2024-11-28 03:08:39,580 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 555 transitions. Word has length 31 [2024-11-28 03:08:39,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:08:39,580 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 555 transitions. [2024-11-28 03:08:39,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 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-28 03:08:39,580 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 555 transitions. [2024-11-28 03:08:39,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 03:08:39,581 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:08:39,581 INFO L218 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-28 03:08:39,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 03:08:39,581 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr98ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:08:39,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:08:39,582 INFO L85 PathProgramCache]: Analyzing trace with hash 437262943, now seen corresponding path program 1 times [2024-11-28 03:08:39,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:08:39,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036117299] [2024-11-28 03:08:39,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:39,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:08:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:39,828 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-28 03:08:39,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:08:39,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036117299] [2024-11-28 03:08:39,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036117299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:08:39,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:08:39,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:08:39,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567707338] [2024-11-28 03:08:39,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:08:39,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:08:39,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:08:39,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:08:39,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:08:39,831 INFO L87 Difference]: Start difference. First operand 398 states and 555 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 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-28 03:08:40,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:08:40,539 INFO L93 Difference]: Finished difference Result 552 states and 758 transitions. [2024-11-28 03:08:40,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:08:40,540 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 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-28 03:08:40,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:08:40,541 INFO L225 Difference]: With dead ends: 552 [2024-11-28 03:08:40,542 INFO L226 Difference]: Without dead ends: 552 [2024-11-28 03:08:40,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-11-28 03:08:40,542 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 294 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:08:40,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 631 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 03:08:40,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-11-28 03:08:40,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 399. [2024-11-28 03:08:40,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 351 states have (on average 1.584045584045584) internal successors, (556), 398 states have internal predecessors, (556), 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-28 03:08:40,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 556 transitions. [2024-11-28 03:08:40,555 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 556 transitions. Word has length 32 [2024-11-28 03:08:40,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:08:40,556 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 556 transitions. [2024-11-28 03:08:40,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 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-28 03:08:40,556 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 556 transitions. [2024-11-28 03:08:40,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-28 03:08:40,557 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:08:40,557 INFO L218 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] [2024-11-28 03:08:40,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-28 03:08:40,558 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:08:40,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:08:40,558 INFO L85 PathProgramCache]: Analyzing trace with hash 670249701, now seen corresponding path program 1 times [2024-11-28 03:08:40,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:08:40,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675330576] [2024-11-28 03:08:40,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:40,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:08:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:40,628 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-28 03:08:40,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:08:40,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675330576] [2024-11-28 03:08:40,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675330576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:08:40,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:08:40,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:08:40,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679577385] [2024-11-28 03:08:40,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:08:40,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:08:40,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:08:40,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:08:40,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:08:40,630 INFO L87 Difference]: Start difference. First operand 399 states and 556 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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-28 03:08:40,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:08:40,906 INFO L93 Difference]: Finished difference Result 398 states and 552 transitions. [2024-11-28 03:08:40,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:08:40,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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-28 03:08:40,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:08:40,908 INFO L225 Difference]: With dead ends: 398 [2024-11-28 03:08:40,908 INFO L226 Difference]: Without dead ends: 398 [2024-11-28 03:08:40,908 INFO L434 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-28 03:08:40,908 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 16 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:08:40,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 393 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:08:40,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-28 03:08:40,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2024-11-28 03:08:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 351 states have (on average 1.5726495726495726) internal successors, (552), 397 states have internal predecessors, (552), 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-28 03:08:40,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 552 transitions. [2024-11-28 03:08:40,916 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 552 transitions. Word has length 33 [2024-11-28 03:08:40,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:08:40,916 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 552 transitions. [2024-11-28 03:08:40,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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-28 03:08:40,917 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 552 transitions. [2024-11-28 03:08:40,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-28 03:08:40,917 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:08:40,917 INFO L218 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-28 03:08:40,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-28 03:08:40,917 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:08:40,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:08:40,919 INFO L85 PathProgramCache]: Analyzing trace with hash -779195442, now seen corresponding path program 1 times [2024-11-28 03:08:40,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:08:40,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775357081] [2024-11-28 03:08:40,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:40,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:08:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:41,372 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-28 03:08:41,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:08:41,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775357081] [2024-11-28 03:08:41,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775357081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:08:41,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:08:41,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 03:08:41,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000509366] [2024-11-28 03:08:41,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:08:41,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 03:08:41,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:08:41,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 03:08:41,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:08:41,374 INFO L87 Difference]: Start difference. First operand 398 states and 552 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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-28 03:08:42,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:08:42,144 INFO L93 Difference]: Finished difference Result 539 states and 740 transitions. [2024-11-28 03:08:42,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 03:08:42,144 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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-28 03:08:42,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:08:42,146 INFO L225 Difference]: With dead ends: 539 [2024-11-28 03:08:42,146 INFO L226 Difference]: Without dead ends: 539 [2024-11-28 03:08:42,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-11-28 03:08:42,147 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 285 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:08:42,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 1053 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 03:08:42,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-28 03:08:42,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 398. [2024-11-28 03:08:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 351 states have (on average 1.5698005698005697) internal successors, (551), 397 states have internal predecessors, (551), 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-28 03:08:42,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 551 transitions. [2024-11-28 03:08:42,154 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 551 transitions. Word has length 34 [2024-11-28 03:08:42,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:08:42,154 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 551 transitions. [2024-11-28 03:08:42,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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-28 03:08:42,154 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 551 transitions. [2024-11-28 03:08:42,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 03:08:42,155 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:08:42,155 INFO L218 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] [2024-11-28 03:08:42,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-28 03:08:42,155 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:08:42,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:08:42,156 INFO L85 PathProgramCache]: Analyzing trace with hash -766917907, now seen corresponding path program 1 times [2024-11-28 03:08:42,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:08:42,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922761718] [2024-11-28 03:08:42,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:42,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:08:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:42,275 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-28 03:08:42,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:08:42,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922761718] [2024-11-28 03:08:42,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922761718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:08:42,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:08:42,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:08:42,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925068319] [2024-11-28 03:08:42,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:08:42,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:08:42,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:08:42,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:08:42,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:08:42,278 INFO L87 Difference]: Start difference. First operand 398 states and 551 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-28 03:08:42,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:08:42,492 INFO L93 Difference]: Finished difference Result 397 states and 550 transitions. [2024-11-28 03:08:42,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:08:42,493 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 35 [2024-11-28 03:08:42,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:08:42,494 INFO L225 Difference]: With dead ends: 397 [2024-11-28 03:08:42,494 INFO L226 Difference]: Without dead ends: 397 [2024-11-28 03:08:42,494 INFO L434 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-28 03:08:42,495 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:08:42,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 466 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:08:42,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-28 03:08:42,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2024-11-28 03:08:42,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 351 states have (on average 1.566951566951567) internal successors, (550), 396 states have internal predecessors, (550), 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-28 03:08:42,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 550 transitions. [2024-11-28 03:08:42,502 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 550 transitions. Word has length 35 [2024-11-28 03:08:42,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:08:42,502 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 550 transitions. [2024-11-28 03:08:42,502 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-28 03:08:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 550 transitions. [2024-11-28 03:08:42,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 03:08:42,504 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:08:42,504 INFO L218 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] [2024-11-28 03:08:42,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-28 03:08:42,504 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:08:42,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:08:42,505 INFO L85 PathProgramCache]: Analyzing trace with hash -766917906, now seen corresponding path program 1 times [2024-11-28 03:08:42,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:08:42,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529823034] [2024-11-28 03:08:42,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:42,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:08:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:42,700 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-28 03:08:42,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:08:42,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529823034] [2024-11-28 03:08:42,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529823034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:08:42,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:08:42,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:08:42,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287975346] [2024-11-28 03:08:42,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:08:42,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:08:42,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:08:42,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:08:42,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:08:42,702 INFO L87 Difference]: Start difference. First operand 397 states and 550 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-28 03:08:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:08:42,940 INFO L93 Difference]: Finished difference Result 396 states and 549 transitions. [2024-11-28 03:08:42,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:08:42,940 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 35 [2024-11-28 03:08:42,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:08:42,942 INFO L225 Difference]: With dead ends: 396 [2024-11-28 03:08:42,942 INFO L226 Difference]: Without dead ends: 396 [2024-11-28 03:08:42,942 INFO L434 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-28 03:08:42,942 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:08:42,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:08:42,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-28 03:08:42,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-28 03:08:42,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 351 states have (on average 1.564102564102564) internal successors, (549), 395 states have internal predecessors, (549), 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-28 03:08:42,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 549 transitions. [2024-11-28 03:08:42,950 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 549 transitions. Word has length 35 [2024-11-28 03:08:42,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:08:42,950 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 549 transitions. [2024-11-28 03:08:42,950 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-28 03:08:42,951 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 549 transitions. [2024-11-28 03:08:42,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 03:08:42,951 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:08:42,951 INFO L218 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] [2024-11-28 03:08:42,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-28 03:08:42,952 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:08:42,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:08:42,952 INFO L85 PathProgramCache]: Analyzing trace with hash -135120281, now seen corresponding path program 1 times [2024-11-28 03:08:42,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:08:42,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422066598] [2024-11-28 03:08:42,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:42,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:08:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:43,010 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-28 03:08:43,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:08:43,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422066598] [2024-11-28 03:08:43,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422066598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:08:43,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:08:43,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:08:43,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091894427] [2024-11-28 03:08:43,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:08:43,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:08:43,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:08:43,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:08:43,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:08:43,012 INFO L87 Difference]: Start difference. First operand 396 states and 549 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 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-28 03:08:43,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:08:43,276 INFO L93 Difference]: Finished difference Result 505 states and 657 transitions. [2024-11-28 03:08:43,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:08:43,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 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 35 [2024-11-28 03:08:43,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:08:43,279 INFO L225 Difference]: With dead ends: 505 [2024-11-28 03:08:43,279 INFO L226 Difference]: Without dead ends: 505 [2024-11-28 03:08:43,279 INFO L434 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-28 03:08:43,279 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 250 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:08:43,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 348 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:08:43,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-28 03:08:43,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 418. [2024-11-28 03:08:43,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 373 states have (on average 1.581769436997319) internal successors, (590), 417 states have internal predecessors, (590), 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-28 03:08:43,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 590 transitions. [2024-11-28 03:08:43,288 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 590 transitions. Word has length 35 [2024-11-28 03:08:43,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:08:43,289 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 590 transitions. [2024-11-28 03:08:43,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 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-28 03:08:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 590 transitions. [2024-11-28 03:08:43,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-28 03:08:43,290 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:08:43,290 INFO L218 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-28 03:08:43,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-28 03:08:43,290 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:08:43,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:08:43,291 INFO L85 PathProgramCache]: Analyzing trace with hash 106238947, now seen corresponding path program 1 times [2024-11-28 03:08:43,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:08:43,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894566239] [2024-11-28 03:08:43,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:43,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:08:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:43,768 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-28 03:08:43,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:08:43,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894566239] [2024-11-28 03:08:43,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894566239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:08:43,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:08:43,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 03:08:43,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132337438] [2024-11-28 03:08:43,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:08:43,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 03:08:43,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:08:43,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 03:08:43,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-28 03:08:43,771 INFO L87 Difference]: Start difference. First operand 418 states and 590 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-28 03:08:45,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:08:45,415 INFO L93 Difference]: Finished difference Result 684 states and 914 transitions. [2024-11-28 03:08:45,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 03:08:45,416 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-28 03:08:45,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:08:45,417 INFO L225 Difference]: With dead ends: 684 [2024-11-28 03:08:45,417 INFO L226 Difference]: Without dead ends: 684 [2024-11-28 03:08:45,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=782, Unknown=0, NotChecked=0, Total=992 [2024-11-28 03:08:45,418 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 512 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:08:45,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 782 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-28 03:08:45,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2024-11-28 03:08:45,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 446. [2024-11-28 03:08:45,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 401 states have (on average 1.5810473815461346) internal successors, (634), 445 states have internal predecessors, (634), 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-28 03:08:45,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 634 transitions. [2024-11-28 03:08:45,427 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 634 transitions. Word has length 36 [2024-11-28 03:08:45,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:08:45,428 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 634 transitions. [2024-11-28 03:08:45,428 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-28 03:08:45,428 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 634 transitions. [2024-11-28 03:08:45,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-28 03:08:45,428 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:08:45,429 INFO L218 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] [2024-11-28 03:08:45,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-28 03:08:45,429 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:08:45,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:08:45,430 INFO L85 PathProgramCache]: Analyzing trace with hash -545811985, now seen corresponding path program 1 times [2024-11-28 03:08:45,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:08:45,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374558773] [2024-11-28 03:08:45,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:45,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:08:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:46,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:08:46,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:08:46,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374558773] [2024-11-28 03:08:46,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374558773] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:08:46,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798091447] [2024-11-28 03:08:46,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:08:46,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:08:46,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:08:46,083 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:08:46,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:08:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:08:46,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-28 03:08:46,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:08:46,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:08:46,324 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-28 03:08:46,332 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-28 03:08:46,384 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:08:46,384 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 17 treesize of output 21 [2024-11-28 03:08:46,450 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 29 treesize of output 13 [2024-11-28 03:08:46,464 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 29 treesize of output 13 [2024-11-28 03:08:46,608 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:08:46,609 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 71 treesize of output 64 [2024-11-28 03:08:46,614 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-28 03:08:46,704 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-28 03:08:46,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2024-11-28 03:08:46,797 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 38 treesize of output 29 [2024-11-28 03:08:46,809 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 18 treesize of output 13 [2024-11-28 03:08:46,935 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:08:46,935 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 60 treesize of output 55 [2024-11-28 03:08:46,943 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-28 03:08:47,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:08:47,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:08:47,262 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 4))) (and (forall ((v_ArrVal_1341 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1341) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_1342 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 0)))) is different from false [2024-11-28 03:08:47,282 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 4))) (and (forall ((v_ArrVal_1342 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1342) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1341 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1341) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) 0)))) is different from false [2024-11-28 03:08:51,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:08:51,945 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 2 case distinctions, treesize of input 60 treesize of output 51 [2024-11-28 03:08:51,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:08:51,966 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 737 treesize of output 557 [2024-11-28 03:08:51,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:08:51,995 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 120 treesize of output 96 [2024-11-28 03:08:52,008 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 96 treesize of output 84 [2024-11-28 03:08:52,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:08:52,058 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 58 treesize of output 46 [2024-11-28 03:08:52,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:08:52,255 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 2 case distinctions, treesize of input 60 treesize of output 66 [2024-11-28 03:08:52,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:08:52,305 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 2 case distinctions, treesize of input 45 treesize of output 51 [2024-11-28 03:08:52,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 365 treesize of output 251 [2024-11-28 03:08:52,336 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 2022 treesize of output 1938 [2024-11-28 03:08:52,357 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 41 treesize of output 33 [2024-11-28 03:08:52,372 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 33 treesize of output 29 [2024-11-28 03:08:52,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 108 treesize of output 96 [2024-11-28 03:08:52,397 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 70 treesize of output 54 [2024-11-28 03:08:52,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 54 treesize of output 46 [2024-11-28 03:08:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:08:57,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798091447] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:08:57,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:08:57,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 15] total 33 [2024-11-28 03:08:57,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124968060] [2024-11-28 03:08:57,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:08:57,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-28 03:08:57,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:08:57,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-28 03:08:57,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=793, Unknown=28, NotChecked=118, Total=1056 [2024-11-28 03:08:57,056 INFO L87 Difference]: Start difference. First operand 446 states and 634 transitions. Second operand has 33 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 33 states have internal predecessors, (100), 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-28 03:09:07,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:09:07,173 INFO L93 Difference]: Finished difference Result 801 states and 1061 transitions. [2024-11-28 03:09:07,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 03:09:07,174 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 33 states have internal predecessors, (100), 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-28 03:09:07,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:09:07,175 INFO L225 Difference]: With dead ends: 801 [2024-11-28 03:09:07,176 INFO L226 Difference]: Without dead ends: 801 [2024-11-28 03:09:07,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=321, Invalid=1634, Unknown=33, NotChecked=174, Total=2162 [2024-11-28 03:09:07,176 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 1078 mSDsluCounter, 2837 mSDsCounter, 0 mSdLazyCounter, 2215 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 2970 SdHoareTripleChecker+Invalid, 3120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 853 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:09:07,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 2970 Invalid, 3120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2215 Invalid, 0 Unknown, 853 Unchecked, 8.0s Time] [2024-11-28 03:09:07,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-11-28 03:09:07,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 463. [2024-11-28 03:09:07,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 418 states have (on average 1.569377990430622) internal successors, (656), 462 states have internal predecessors, (656), 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-28 03:09:07,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 656 transitions. [2024-11-28 03:09:07,187 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 656 transitions. Word has length 38 [2024-11-28 03:09:07,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:09:07,188 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 656 transitions. [2024-11-28 03:09:07,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 33 states have internal predecessors, (100), 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-28 03:09:07,188 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 656 transitions. [2024-11-28 03:09:07,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-28 03:09:07,189 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:09:07,189 INFO L218 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] [2024-11-28 03:09:07,201 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 03:09:07,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-28 03:09:07,389 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:09:07,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:09:07,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1621896712, now seen corresponding path program 1 times [2024-11-28 03:09:07,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:09:07,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391255799] [2024-11-28 03:09:07,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:09:07,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:09:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:09:09,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:09:09,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:09:09,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391255799] [2024-11-28 03:09:09,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391255799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:09:09,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260323186] [2024-11-28 03:09:09,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:09:09,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:09:09,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:09:09,272 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:09:09,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:09:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:09:09,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-28 03:09:09,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:09:09,470 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-28 03:09:09,555 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-28 03:09:09,570 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-28 03:09:09,683 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 27 treesize of output 11 [2024-11-28 03:09:09,699 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 20 [2024-11-28 03:09:09,866 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:09:09,866 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-28 03:09:10,007 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 11 [2024-11-28 03:09:10,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2024-11-28 03:09:10,546 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:09:10,546 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 58 treesize of output 53 [2024-11-28 03:09:10,559 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 37 treesize of output 18 [2024-11-28 03:09:10,761 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:09:10,761 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-28 03:09:11,016 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 25 treesize of output 18 [2024-11-28 03:09:11,044 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 26 treesize of output 19 [2024-11-28 03:09:11,425 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:09:11,426 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 58 treesize of output 53 [2024-11-28 03:09:11,435 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 37 treesize of output 18 [2024-11-28 03:09:11,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2024-11-28 03:09:12,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:09:12,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:09:12,813 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)))) (and (forall ((v_ArrVal_1441 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1441) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (forall ((v_ArrVal_1440 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1440) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)))) is different from false [2024-11-28 03:09:12,861 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (forall ((v_ArrVal_1439 (Array Int Int)) (v_ArrVal_1438 (Array Int Int)) (v_ArrVal_1440 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1438) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1439) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_1440) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (forall ((v_ArrVal_1439 (Array Int Int)) (v_ArrVal_1441 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1439))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_1441)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)))) is different from false [2024-11-28 03:09:20,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:09:20,445 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 118 treesize of output 136 [2024-11-28 03:09:21,131 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0 |c_ULTIMATE.start_main_#t~malloc4#1.base|)))) (and (forall ((|ULTIMATE.start_main_#t~malloc4#1.offset| Int) (v_ArrVal_1438 (Array Int Int)) (v_ArrVal_1437 (Array Int Int)) (v_prenex_28 Int) (v_ArrVal_1440 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_27 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0 |ULTIMATE.start_main_#t~malloc4#1.offset|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1437) v_prenex_28 v_ArrVal_1438) (select (select (store (store .cse1 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_29) v_prenex_28 v_prenex_27) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_1440) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0) (= v_prenex_28 |c_ULTIMATE.start_main_~tree~0#1.base|))) (forall ((v_ArrVal_1439 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_30| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1441 (Array Int Int))) (or (= |v_ULTIMATE.start_main_~tmpList~0#1.base_30| |c_ULTIMATE.start_main_~tree~0#1.base|) (= (select (select (let ((.cse2 (store (store .cse1 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1436) |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1439))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_1441)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)))))) is different from false [2024-11-28 03:09:37,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:09:37,637 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 3 case distinctions, treesize of input 64 treesize of output 75 [2024-11-28 03:09:37,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:09:37,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 57 [2024-11-28 03:09:37,776 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:09:37,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 53 [2024-11-28 03:09:37,833 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:09:37,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:09:37,865 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 118 treesize of output 100 [2024-11-28 03:09:37,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-28 03:09:37,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-28 03:09:37,984 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 10 treesize of output 8 [2024-11-28 03:09:38,058 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-28 03:09:38,058 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 3 case distinctions, treesize of input 64 treesize of output 1 [2024-11-28 03:09:46,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:09:46,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260323186] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:09:46,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:09:46,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 16] total 37 [2024-11-28 03:09:46,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911187785] [2024-11-28 03:09:46,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:09:46,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-28 03:09:46,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:09:46,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-28 03:09:46,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=967, Unknown=29, NotChecked=198, Total=1332 [2024-11-28 03:09:46,652 INFO L87 Difference]: Start difference. First operand 463 states and 656 transitions. Second operand has 37 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 37 states have internal predecessors, (95), 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-28 03:10:16,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:10:16,905 INFO L93 Difference]: Finished difference Result 793 states and 1051 transitions. [2024-11-28 03:10:16,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 03:10:16,906 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 37 states have internal predecessors, (95), 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-28 03:10:16,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:10:16,908 INFO L225 Difference]: With dead ends: 793 [2024-11-28 03:10:16,908 INFO L226 Difference]: Without dead ends: 793 [2024-11-28 03:10:16,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 40.1s TimeCoverageRelationStatistics Valid=425, Invalid=2108, Unknown=29, NotChecked=300, Total=2862 [2024-11-28 03:10:16,910 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1262 mSDsluCounter, 2221 mSDsCounter, 0 mSdLazyCounter, 2404 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 2345 SdHoareTripleChecker+Invalid, 3898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1443 IncrementalHoareTripleChecker+Unchecked, 24.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:10:16,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 2345 Invalid, 3898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2404 Invalid, 0 Unknown, 1443 Unchecked, 24.4s Time] [2024-11-28 03:10:16,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2024-11-28 03:10:16,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 517. [2024-11-28 03:10:16,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 472 states have (on average 1.5741525423728813) internal successors, (743), 516 states have internal predecessors, (743), 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-28 03:10:16,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 743 transitions. [2024-11-28 03:10:16,925 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 743 transitions. Word has length 38 [2024-11-28 03:10:16,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:10:16,929 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 743 transitions. [2024-11-28 03:10:16,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.5675675675675675) internal successors, (95), 37 states have internal predecessors, (95), 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-28 03:10:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 743 transitions. [2024-11-28 03:10:16,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-28 03:10:16,930 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:10:16,930 INFO L218 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] [2024-11-28 03:10:16,944 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 03:10:17,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-28 03:10:17,131 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:10:17,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:10:17,131 INFO L85 PathProgramCache]: Analyzing trace with hash -284588616, now seen corresponding path program 1 times [2024-11-28 03:10:17,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:10:17,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876882522] [2024-11-28 03:10:17,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:10:17,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:10:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:10:19,956 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-28 03:10:19,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:10:19,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876882522] [2024-11-28 03:10:19,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876882522] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:10:19,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037573783] [2024-11-28 03:10:19,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:10:19,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:10:19,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:10:19,959 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:10:19,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:10:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:10:20,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-28 03:10:20,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:10:20,181 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-28 03:10:20,543 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:10:20,544 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-28 03:10:20,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:10:20,900 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-28 03:10:21,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-28 03:10:21,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:10:21,871 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2024-11-28 03:10:22,424 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:10:22,424 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-28 03:10:22,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-28 03:10:23,553 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:10:23,553 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-28 03:10:25,161 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-28 03:10:25,185 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-28 03:10:25,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:10:25,871 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-28 03:10:25,871 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-28 03:10:26,290 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1531 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1531) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))))) is different from false [2024-11-28 03:10:26,355 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1531 (Array Int Int)) (v_ArrVal_1530 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1530)) (.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1531) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))))) is different from false [2024-11-28 03:10:32,438 INFO L349 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2024-11-28 03:10:32,438 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 2 case distinctions, treesize of input 117 treesize of output 52 [2024-11-28 03:10:32,467 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:10:32,478 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 44 treesize of output 20 [2024-11-28 03:10:32,498 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-28 03:10:32,605 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:10:32,606 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 13 treesize of output 12 [2024-11-28 03:10:33,293 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-28 03:10:33,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037573783] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:10:33,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:10:33,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 33 [2024-11-28 03:10:33,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338901684] [2024-11-28 03:10:33,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:10:33,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-28 03:10:33,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:10:33,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-28 03:10:33,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=847, Unknown=13, NotChecked=122, Total=1122 [2024-11-28 03:10:33,295 INFO L87 Difference]: Start difference. First operand 517 states and 743 transitions. Second operand has 34 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 34 states have internal predecessors, (101), 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-28 03:10:53,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:10:53,725 INFO L93 Difference]: Finished difference Result 714 states and 1000 transitions. [2024-11-28 03:10:53,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:10:53,725 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 34 states have internal predecessors, (101), 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-28 03:10:53,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:10:53,728 INFO L225 Difference]: With dead ends: 714 [2024-11-28 03:10:53,728 INFO L226 Difference]: Without dead ends: 714 [2024-11-28 03:10:53,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=296, Invalid=1421, Unknown=13, NotChecked=162, Total=1892 [2024-11-28 03:10:53,731 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 794 mSDsluCounter, 2165 mSDsCounter, 0 mSdLazyCounter, 1788 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 2298 SdHoareTripleChecker+Invalid, 2515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 681 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:10:53,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 2298 Invalid, 2515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1788 Invalid, 0 Unknown, 681 Unchecked, 17.4s Time] [2024-11-28 03:10:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2024-11-28 03:10:53,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 521. [2024-11-28 03:10:53,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 476 states have (on average 1.5714285714285714) internal successors, (748), 520 states have internal predecessors, (748), 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-28 03:10:53,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 748 transitions. [2024-11-28 03:10:53,742 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 748 transitions. Word has length 38 [2024-11-28 03:10:53,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:10:53,742 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 748 transitions. [2024-11-28 03:10:53,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 34 states have internal predecessors, (101), 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-28 03:10:53,742 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 748 transitions. [2024-11-28 03:10:53,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-28 03:10:53,743 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:10:53,743 INFO L218 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] [2024-11-28 03:10:53,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 03:10:53,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:10:53,948 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:10:53,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:10:53,948 INFO L85 PathProgramCache]: Analyzing trace with hash -284588615, now seen corresponding path program 1 times [2024-11-28 03:10:53,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:10:53,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34935671] [2024-11-28 03:10:53,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:10:53,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:10:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:10:57,373 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-28 03:10:57,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:10:57,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34935671] [2024-11-28 03:10:57,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34935671] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:10:57,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342328498] [2024-11-28 03:10:57,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:10:57,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:10:57,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:10:57,376 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:10:57,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 03:10:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:10:57,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-28 03:10:57,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:10:57,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:10:57,945 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:10:57,945 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-28 03:10:58,177 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-28 03:10:58,970 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:10:58,970 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 31 treesize of output 32 [2024-11-28 03:10:59,218 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:10:59,218 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-28 03:11:00,251 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 38 treesize of output 31 [2024-11-28 03:11:00,272 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 37 treesize of output 30 [2024-11-28 03:11:01,177 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:11:01,177 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 70 treesize of output 65 [2024-11-28 03:11:01,200 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 49 treesize of output 30 [2024-11-28 03:11:02,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-28 03:11:02,591 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 32 treesize of output 14 [2024-11-28 03:11:02,936 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-28 03:11:02,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:11:04,296 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (forall ((v_ArrVal_1621 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1621) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (forall ((v_ArrVal_1622 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1621) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1622) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)))))) is different from false [2024-11-28 03:11:04,382 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1621 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1621) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (forall ((v_ArrVal_1622 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1621) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1622) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))))))) is different from false [2024-11-28 03:11:04,504 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (forall ((v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (v_ArrVal_1619 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1620) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1619) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_1621) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (forall ((v_ArrVal_1622 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (v_ArrVal_1619 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1619))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1620) .cse1 v_ArrVal_1621) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1622) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)))))))) is different from false [2024-11-28 03:11:04,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:11:04,619 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 82 treesize of output 86 [2024-11-28 03:11:05,314 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 349 treesize of output 301 [2024-11-28 03:11:05,344 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 172 treesize of output 168 [2024-11-28 03:11:05,372 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 168 treesize of output 160 [2024-11-28 03:11:05,402 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 160 treesize of output 156 [2024-11-28 03:11:05,431 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 156 treesize of output 148 [2024-11-28 03:11:07,747 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:11:07,747 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 13 treesize of output 12 [2024-11-28 03:11:08,107 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-28 03:11:08,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342328498] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:11:08,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:11:08,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 33 [2024-11-28 03:11:08,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375314838] [2024-11-28 03:11:08,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:11:08,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-28 03:11:08,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:11:08,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-28 03:11:08,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=820, Unknown=4, NotChecked=180, Total=1122 [2024-11-28 03:11:08,109 INFO L87 Difference]: Start difference. First operand 521 states and 748 transitions. Second operand has 34 states, 33 states have (on average 3.3636363636363638) internal successors, (111), 34 states have internal predecessors, (111), 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-28 03:11:33,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:11:33,226 INFO L93 Difference]: Finished difference Result 714 states and 999 transitions. [2024-11-28 03:11:33,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 03:11:33,227 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.3636363636363638) internal successors, (111), 34 states have internal predecessors, (111), 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-28 03:11:33,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:11:33,229 INFO L225 Difference]: With dead ends: 714 [2024-11-28 03:11:33,229 INFO L226 Difference]: Without dead ends: 714 [2024-11-28 03:11:33,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=335, Invalid=1743, Unknown=4, NotChecked=270, Total=2352 [2024-11-28 03:11:33,231 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 904 mSDsluCounter, 1851 mSDsCounter, 0 mSdLazyCounter, 2059 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 3240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1144 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:11:33,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 2010 Invalid, 3240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2059 Invalid, 0 Unknown, 1144 Unchecked, 20.1s Time] [2024-11-28 03:11:33,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2024-11-28 03:11:33,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 521. [2024-11-28 03:11:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 476 states have (on average 1.569327731092437) internal successors, (747), 520 states have internal predecessors, (747), 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-28 03:11:33,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 747 transitions. [2024-11-28 03:11:33,252 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 747 transitions. Word has length 38 [2024-11-28 03:11:33,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:11:33,252 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 747 transitions. [2024-11-28 03:11:33,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.3636363636363638) internal successors, (111), 34 states have internal predecessors, (111), 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-28 03:11:33,252 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 747 transitions. [2024-11-28 03:11:33,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-28 03:11:33,253 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:11:33,253 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-28 03:11:33,265 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 03:11:33,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:11:33,454 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:11:33,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:11:33,454 INFO L85 PathProgramCache]: Analyzing trace with hash -426193586, now seen corresponding path program 1 times [2024-11-28 03:11:33,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:11:33,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274576514] [2024-11-28 03:11:33,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:11:33,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:11:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:11:33,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:11:33,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:11:33,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274576514] [2024-11-28 03:11:33,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274576514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:11:33,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:11:33,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:11:33,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84880896] [2024-11-28 03:11:33,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:11:33,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:11:33,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:11:33,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:11:33,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:11:33,615 INFO L87 Difference]: Start difference. First operand 521 states and 747 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-28 03:11:33,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:11:33,835 INFO L93 Difference]: Finished difference Result 510 states and 693 transitions. [2024-11-28 03:11:33,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:11:33,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-28 03:11:33,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:11:33,838 INFO L225 Difference]: With dead ends: 510 [2024-11-28 03:11:33,838 INFO L226 Difference]: Without dead ends: 510 [2024-11-28 03:11:33,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:11:33,839 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 30 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:11:33,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 328 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:11:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-11-28 03:11:33,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 491. [2024-11-28 03:11:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 446 states have (on average 1.553811659192825) internal successors, (693), 490 states have internal predecessors, (693), 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-28 03:11:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 693 transitions. [2024-11-28 03:11:33,847 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 693 transitions. Word has length 39 [2024-11-28 03:11:33,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:11:33,847 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 693 transitions. [2024-11-28 03:11:33,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-28 03:11:33,847 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 693 transitions. [2024-11-28 03:11:33,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-28 03:11:33,848 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:11:33,848 INFO L218 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] [2024-11-28 03:11:33,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-28 03:11:33,848 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:11:33,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:11:33,849 INFO L85 PathProgramCache]: Analyzing trace with hash -426187603, now seen corresponding path program 1 times [2024-11-28 03:11:33,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:11:33,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199699350] [2024-11-28 03:11:33,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:11:33,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:11:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:11:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:11:35,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:11:35,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199699350] [2024-11-28 03:11:35,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199699350] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:11:35,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849414385] [2024-11-28 03:11:35,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:11:35,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:11:35,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:11:35,774 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:11:35,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 03:11:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:11:35,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-28 03:11:35,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:11:36,929 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-28 03:11:37,953 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 03:11:37,953 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 48 treesize of output 45 [2024-11-28 03:11:40,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:11:40,862 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 41 treesize of output 31 [2024-11-28 03:11:43,406 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~mem50#1.base_15| Int) (|v_ULTIMATE.start_main_~tmp~0#1.base_83| Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~mem50#1.base_15| 0) |v_ULTIMATE.start_main_~tmp~0#1.base_83| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~tmp~0#1.base_83| 1) |v_ULTIMATE.start_main_#t~mem50#1.base_15|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~tmp~0#1.base_83|) 0))) is different from true [2024-11-28 03:11:43,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-28 03:11:43,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:11:46,274 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1716 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1716) |c_ULTIMATE.start_main_~tree~0#1.base|) 8) 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0))) is different from false [2024-11-28 03:11:46,334 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1716 (Array Int Int))) (= (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1716) |c_ULTIMATE.start_main_~tree~0#1.base|) 8) 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-28 03:11:46,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:11:46,424 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 30 treesize of output 31 [2024-11-28 03:11:46,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:11:46,504 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 52 treesize of output 50 [2024-11-28 03:11:46,529 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 19 treesize of output 17 [2024-11-28 03:11:50,929 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store (store |c_#valid| |c_ULTIMATE.start_main_#t~malloc4#1.base| 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0)) (.cse0 (= |c_ULTIMATE.start_main_~tree~0#1.offset| 0)) (.cse2 (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|))) (and (or (and (or .cse0 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_154 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store |c_#valid| v_arrayElimCell_154 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0) v_antiDerIndex_entry0_1)))) (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse1 v_antiDerIndex_entry0_1)))) .cse2) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_155 Int)) (let ((.cse3 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse3 (select .cse1 v_antiDerIndex_entry0_1)) (= .cse3 (select (store (store |c_#valid| v_arrayElimCell_155 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse0 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_155 Int) (v_arrayElimCell_154 Int)) (let ((.cse4 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse4 (select (store (store |c_#valid| v_arrayElimCell_155 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse4 (select (store (store |c_#valid| v_arrayElimCell_154 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_155 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store |c_#valid| v_arrayElimCell_155 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0) v_antiDerIndex_entry0_1))) (not .cse2)))) is different from false [2024-11-28 03:11:52,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:11:52,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849414385] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:11:52,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:11:52,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2024-11-28 03:11:52,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433776501] [2024-11-28 03:11:52,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:11:52,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-28 03:11:52,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:11:52,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-28 03:11:52,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=632, Unknown=4, NotChecked=212, Total=930 [2024-11-28 03:11:52,969 INFO L87 Difference]: Start difference. First operand 491 states and 693 transitions. Second operand has 31 states, 30 states have (on average 3.6666666666666665) internal successors, (110), 31 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-28 03:12:13,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:12:13,053 INFO L93 Difference]: Finished difference Result 504 states and 706 transitions. [2024-11-28 03:12:13,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:12:13,053 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.6666666666666665) internal successors, (110), 31 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) Word has length 39 [2024-11-28 03:12:13,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:12:13,055 INFO L225 Difference]: With dead ends: 504 [2024-11-28 03:12:13,055 INFO L226 Difference]: Without dead ends: 479 [2024-11-28 03:12:13,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=143, Invalid=991, Unknown=4, NotChecked=268, Total=1406 [2024-11-28 03:12:13,056 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 127 mSDsluCounter, 1773 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1921 SdHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 614 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:12:13,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1921 Invalid, 2349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1725 Invalid, 1 Unknown, 614 Unchecked, 17.3s Time] [2024-11-28 03:12:13,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-28 03:12:13,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 475. [2024-11-28 03:12:13,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 430 states have (on average 1.572093023255814) internal successors, (676), 474 states have internal predecessors, (676), 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-28 03:12:13,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 676 transitions. [2024-11-28 03:12:13,064 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 676 transitions. Word has length 39 [2024-11-28 03:12:13,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:12:13,065 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 676 transitions. [2024-11-28 03:12:13,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.6666666666666665) internal successors, (110), 31 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-28 03:12:13,065 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 676 transitions. [2024-11-28 03:12:13,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-28 03:12:13,066 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:12:13,066 INFO L218 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] [2024-11-28 03:12:13,079 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 03:12:13,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2024-11-28 03:12:13,270 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:12:13,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:12:13,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1572709107, now seen corresponding path program 1 times [2024-11-28 03:12:13,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:12:13,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273268147] [2024-11-28 03:12:13,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:12:13,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:12:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:12:16,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:12:16,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:12:16,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273268147] [2024-11-28 03:12:16,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273268147] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:12:16,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229947887] [2024-11-28 03:12:16,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:12:16,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:12:16,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:12:16,067 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:12:16,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 03:12:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:12:16,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-28 03:12:16,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:12:16,290 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-28 03:12:16,352 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-28 03:12:16,414 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-28 03:12:16,701 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 03:12:16,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 03:12:17,081 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 29 treesize of output 13 [2024-11-28 03:12:17,137 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 29 treesize of output 13 [2024-11-28 03:12:17,721 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:12:17,722 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 60 treesize of output 55 [2024-11-28 03:12:17,744 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-28 03:12:18,168 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:12:18,168 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-28 03:12:18,430 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 21 [2024-11-28 03:12:18,500 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-28 03:12:19,306 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:12:19,306 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 60 treesize of output 55 [2024-11-28 03:12:19,350 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-28 03:12:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:12:20,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:12:21,014 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 4))) (and (forall ((v_ArrVal_1815 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1815) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_1814 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1814) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 0)))) is different from false [2024-11-28 03:12:21,523 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) (.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 4))) (and (forall ((v_ArrVal_1812 (Array Int Int)) (v_ArrVal_1815 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1812))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1815)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1812 (Array Int Int)) (v_ArrVal_1814 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1813) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1812) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1814) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) 0)))) is different from false [2024-11-28 03:12:27,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:12:27,270 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 2 case distinctions, treesize of input 60 treesize of output 51 [2024-11-28 03:12:27,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:12:27,308 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 6622 treesize of output 4798 [2024-11-28 03:12:27,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:12:27,396 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 831 treesize of output 767 [2024-11-28 03:12:27,424 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 767 treesize of output 711 [2024-11-28 03:12:27,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:12:27,479 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 711 treesize of output 583 [2024-11-28 03:12:28,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:12:28,249 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 2 case distinctions, treesize of input 60 treesize of output 66 [2024-11-28 03:12:28,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:12:28,353 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 2 case distinctions, treesize of input 45 treesize of output 51 [2024-11-28 03:12:28,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 139 [2024-11-28 03:12:28,413 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:12:28,424 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 528 treesize of output 480 [2024-11-28 03:12:28,459 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 104 treesize of output 92 [2024-11-28 03:12:28,484 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 70 treesize of output 62 [2024-11-28 03:12:28,507 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 62 treesize of output 54 [2024-11-28 03:12:28,530 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 76 treesize of output 64 [2024-11-28 03:12:37,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:12:37,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229947887] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:12:37,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:12:37,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 26 [2024-11-28 03:12:37,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307751853] [2024-11-28 03:12:37,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:12:37,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 03:12:37,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:12:37,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 03:12:37,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=446, Unknown=19, NotChecked=90, Total=650 [2024-11-28 03:12:37,240 INFO L87 Difference]: Start difference. First operand 475 states and 676 transitions. Second operand has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 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-28 03:12:54,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:12:54,576 INFO L93 Difference]: Finished difference Result 573 states and 785 transitions. [2024-11-28 03:12:54,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 03:12:54,577 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 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 40 [2024-11-28 03:12:54,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:12:54,579 INFO L225 Difference]: With dead ends: 573 [2024-11-28 03:12:54,579 INFO L226 Difference]: Without dead ends: 573 [2024-11-28 03:12:54,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=170, Invalid=631, Unknown=19, NotChecked=110, Total=930 [2024-11-28 03:12:54,580 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 395 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 2142 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 488 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:12:54,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 2142 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1512 Invalid, 0 Unknown, 488 Unchecked, 15.9s Time] [2024-11-28 03:12:54,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2024-11-28 03:12:54,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 429. [2024-11-28 03:12:54,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 384 states have (on average 1.5546875) internal successors, (597), 428 states have internal predecessors, (597), 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-28 03:12:54,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 597 transitions. [2024-11-28 03:12:54,588 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 597 transitions. Word has length 40 [2024-11-28 03:12:54,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:12:54,589 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 597 transitions. [2024-11-28 03:12:54,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 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-28 03:12:54,589 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 597 transitions. [2024-11-28 03:12:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 03:12:54,590 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:12:54,590 INFO L218 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-28 03:12:54,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 03:12:54,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-11-28 03:12:54,791 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:12:54,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:12:54,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1747132616, now seen corresponding path program 1 times [2024-11-28 03:12:54,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:12:54,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825017281] [2024-11-28 03:12:54,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:12:54,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:12:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:12:58,603 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-28 03:12:58,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:12:58,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825017281] [2024-11-28 03:12:58,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825017281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:12:58,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:12:58,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 03:12:58,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310232402] [2024-11-28 03:12:58,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:12:58,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 03:12:58,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:12:58,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 03:12:58,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-28 03:12:58,605 INFO L87 Difference]: Start difference. First operand 429 states and 597 transitions. Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 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-28 03:13:09,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:13:09,277 INFO L93 Difference]: Finished difference Result 687 states and 937 transitions. [2024-11-28 03:13:09,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 03:13:09,278 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 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-28 03:13:09,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:13:09,280 INFO L225 Difference]: With dead ends: 687 [2024-11-28 03:13:09,280 INFO L226 Difference]: Without dead ends: 687 [2024-11-28 03:13:09,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2024-11-28 03:13:09,281 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 646 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:13:09,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 862 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2024-11-28 03:13:09,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-28 03:13:09,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 484. [2024-11-28 03:13:09,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 439 states have (on average 1.542141230068337) internal successors, (677), 483 states have internal predecessors, (677), 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-28 03:13:09,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 677 transitions. [2024-11-28 03:13:09,288 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 677 transitions. Word has length 41 [2024-11-28 03:13:09,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:13:09,288 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 677 transitions. [2024-11-28 03:13:09,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 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-28 03:13:09,288 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 677 transitions. [2024-11-28 03:13:09,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 03:13:09,289 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:13:09,289 INFO L218 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-28 03:13:09,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-28 03:13:09,289 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:13:09,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:09,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1747132615, now seen corresponding path program 1 times [2024-11-28 03:13:09,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:09,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315825067] [2024-11-28 03:13:09,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:09,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:14,611 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-28 03:13:14,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:14,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315825067] [2024-11-28 03:13:14,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315825067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:14,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:14,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-28 03:13:14,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968167768] [2024-11-28 03:13:14,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:14,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 03:13:14,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:14,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 03:13:14,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-28 03:13:14,614 INFO L87 Difference]: Start difference. First operand 484 states and 677 transitions. Second operand has 17 states, 16 states have (on average 2.5625) internal successors, (41), 17 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-28 03:13:27,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:13:27,746 INFO L93 Difference]: Finished difference Result 686 states and 936 transitions. [2024-11-28 03:13:27,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 03:13:27,746 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.5625) internal successors, (41), 17 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-28 03:13:27,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:13:27,748 INFO L225 Difference]: With dead ends: 686 [2024-11-28 03:13:27,748 INFO L226 Difference]: Without dead ends: 686 [2024-11-28 03:13:27,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2024-11-28 03:13:27,749 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 1060 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:13:27,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1060 Valid, 826 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2024-11-28 03:13:27,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-11-28 03:13:27,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 484. [2024-11-28 03:13:27,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 439 states have (on average 1.539863325740319) internal successors, (676), 483 states have internal predecessors, (676), 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-28 03:13:27,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 676 transitions. [2024-11-28 03:13:27,754 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 676 transitions. Word has length 41 [2024-11-28 03:13:27,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:13:27,754 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 676 transitions. [2024-11-28 03:13:27,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.5625) internal successors, (41), 17 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-28 03:13:27,754 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 676 transitions. [2024-11-28 03:13:27,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 03:13:27,754 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:13:27,754 INFO L218 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] [2024-11-28 03:13:27,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-28 03:13:27,755 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:13:27,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:27,755 INFO L85 PathProgramCache]: Analyzing trace with hash 86242126, now seen corresponding path program 1 times [2024-11-28 03:13:27,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:27,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057132868] [2024-11-28 03:13:27,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:27,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:30,036 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-28 03:13:30,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:30,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057132868] [2024-11-28 03:13:30,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057132868] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:13:30,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145278950] [2024-11-28 03:13:30,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:30,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:13:30,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:13:30,039 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:13:30,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 03:13:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:30,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-28 03:13:30,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:13:30,256 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-28 03:13:30,571 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:13:30,571 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-28 03:13:30,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:13:30,889 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-28 03:13:31,669 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:13:31,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 03:13:31,691 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-28 03:13:32,067 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:13:32,067 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-28 03:13:32,447 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-28 03:13:32,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-28 03:13:32,765 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 8 [2024-11-28 03:13:33,037 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-28 03:13:34,126 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-28 03:13:34,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:13:35,281 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2035) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) 1)) is different from false [2024-11-28 03:13:35,724 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (< (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_2033) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_2034) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_2035) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)) 1)) is different from false [2024-11-28 03:13:36,311 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_39| Int) (v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_39|) 0)) (< (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2031) |v_ULTIMATE.start_main_~tmpList~0#1.base_39| v_ArrVal_2033) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2032) |v_ULTIMATE.start_main_~tmpList~0#1.base_39| v_ArrVal_2034) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_2035) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)) 1))) is different from false [2024-11-28 03:13:40,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:13:40,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2024-11-28 03:13:40,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:13:40,864 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 40 treesize of output 41 [2024-11-28 03:13:40,880 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:13:40,891 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 54 [2024-11-28 03:13:40,908 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:13:40,920 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 200 treesize of output 176 [2024-11-28 03:13:41,051 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:13:41,051 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 13 treesize of output 12 [2024-11-28 03:13:41,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2024-11-28 03:13:41,094 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-28 03:13:41,116 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 12 treesize of output 8 [2024-11-28 03:13:49,434 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-28 03:13:49,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145278950] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:13:49,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:13:49,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 14] total 29 [2024-11-28 03:13:49,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081367971] [2024-11-28 03:13:49,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:13:49,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-28 03:13:49,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:49,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-28 03:13:49,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=574, Unknown=16, NotChecked=156, Total=870 [2024-11-28 03:13:49,437 INFO L87 Difference]: Start difference. First operand 484 states and 676 transitions. Second operand has 30 states, 29 states have (on average 3.413793103448276) internal successors, (99), 30 states have internal predecessors, (99), 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-28 03:14:03,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:14:03,860 INFO L93 Difference]: Finished difference Result 627 states and 863 transitions. [2024-11-28 03:14:03,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 03:14:03,860 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.413793103448276) internal successors, (99), 30 states have internal predecessors, (99), 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-28 03:14:03,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:14:03,862 INFO L225 Difference]: With dead ends: 627 [2024-11-28 03:14:03,862 INFO L226 Difference]: Without dead ends: 627 [2024-11-28 03:14:03,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=207, Invalid=911, Unknown=16, NotChecked=198, Total=1332 [2024-11-28 03:14:03,863 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 542 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 896 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:14:03,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 1562 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1240 Invalid, 0 Unknown, 896 Unchecked, 12.6s Time] [2024-11-28 03:14:03,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-28 03:14:03,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 487. [2024-11-28 03:14:03,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 442 states have (on average 1.5384615384615385) internal successors, (680), 486 states have internal predecessors, (680), 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-28 03:14:03,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 680 transitions. [2024-11-28 03:14:03,870 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 680 transitions. Word has length 41 [2024-11-28 03:14:03,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:14:03,871 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 680 transitions. [2024-11-28 03:14:03,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.413793103448276) internal successors, (99), 30 states have internal predecessors, (99), 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-28 03:14:03,871 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 680 transitions. [2024-11-28 03:14:03,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-28 03:14:03,871 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:14:03,871 INFO L218 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] [2024-11-28 03:14:03,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 03:14:04,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:14:04,072 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr98ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:14:04,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:14:04,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1621461036, now seen corresponding path program 1 times [2024-11-28 03:14:04,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:14:04,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537679042] [2024-11-28 03:14:04,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:14:04,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:14:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:14:09,459 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-28 03:14:09,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:14:09,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537679042] [2024-11-28 03:14:09,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537679042] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:14:09,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054791690] [2024-11-28 03:14:09,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:14:09,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:14:09,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:14:09,462 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:14:09,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 03:14:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:14:09,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-28 03:14:09,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:14:09,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:14:10,070 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:14:10,070 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-28 03:14:10,433 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-28 03:14:11,472 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:14:11,473 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-28 03:14:11,802 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:14:11,802 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-28 03:14:12,353 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 23 [2024-11-28 03:14:13,336 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:14:13,336 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-28 03:14:14,539 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-28 03:14:14,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-28 03:14:14,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:14:16,495 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2124 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2124) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) |c_#StackHeapBarrier|)) is different from false [2024-11-28 03:14:16,543 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2124 (Array Int Int))) (< (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_2124) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)) |c_#StackHeapBarrier|)) is different from false [2024-11-28 03:14:16,613 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2124 (Array Int Int)) (v_ArrVal_2123 (Array Int Int))) (< (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_2123))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_2124)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)) |c_#StackHeapBarrier|)) is different from false [2024-11-28 03:14:26,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:14:26,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2024-11-28 03:14:26,626 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:14:26,637 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 162 treesize of output 126 [2024-11-28 03:14:26,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-28 03:14:26,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-11-28 03:14:26,818 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:14:26,818 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 13 treesize of output 12 [2024-11-28 03:14:39,268 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-28 03:14:39,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054791690] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:14:39,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:14:39,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 12] total 36 [2024-11-28 03:14:39,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334751723] [2024-11-28 03:14:39,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:14:39,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-28 03:14:39,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:14:39,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-28 03:14:39,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=944, Unknown=16, NotChecked=192, Total=1260 [2024-11-28 03:14:39,270 INFO L87 Difference]: Start difference. First operand 487 states and 680 transitions. Second operand has 36 states, 36 states have (on average 3.388888888888889) internal successors, (122), 36 states have internal predecessors, (122), 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-28 03:15:20,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:20,654 INFO L93 Difference]: Finished difference Result 633 states and 868 transitions. [2024-11-28 03:15:20,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-28 03:15:20,654 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.388888888888889) internal successors, (122), 36 states have internal predecessors, (122), 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 42 [2024-11-28 03:15:20,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:20,656 INFO L225 Difference]: With dead ends: 633 [2024-11-28 03:15:20,656 INFO L226 Difference]: Without dead ends: 631 [2024-11-28 03:15:20,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 39.8s TimeCoverageRelationStatistics Valid=459, Invalid=2729, Unknown=16, NotChecked=336, Total=3540 [2024-11-28 03:15:20,657 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 618 mSDsluCounter, 2576 mSDsCounter, 0 mSdLazyCounter, 2998 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 2725 SdHoareTripleChecker+Invalid, 4037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 990 IncrementalHoareTripleChecker+Unchecked, 30.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:15:20,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 2725 Invalid, 4037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2998 Invalid, 0 Unknown, 990 Unchecked, 30.8s Time] [2024-11-28 03:15:20,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-28 03:15:20,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 485. [2024-11-28 03:15:20,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 440 states have (on average 1.5386363636363636) internal successors, (677), 484 states have internal predecessors, (677), 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-28 03:15:20,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 677 transitions. [2024-11-28 03:15:20,664 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 677 transitions. Word has length 42 [2024-11-28 03:15:20,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:20,664 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 677 transitions. [2024-11-28 03:15:20,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.388888888888889) internal successors, (122), 36 states have internal predecessors, (122), 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-28 03:15:20,664 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 677 transitions. [2024-11-28 03:15:20,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-28 03:15:20,665 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:20,665 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:15:20,672 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 03:15:20,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2024-11-28 03:15:20,865 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:15:20,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:20,866 INFO L85 PathProgramCache]: Analyzing trace with hash -152276901, now seen corresponding path program 1 times [2024-11-28 03:15:20,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:20,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225302611] [2024-11-28 03:15:20,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:20,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:15:21,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:21,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225302611] [2024-11-28 03:15:21,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225302611] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:15:21,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103148007] [2024-11-28 03:15:21,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:21,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:15:21,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:15:21,637 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:15:21,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 03:15:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:21,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-28 03:15:21,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:15:23,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:15:23,372 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 16 treesize of output 11 [2024-11-28 03:15:23,481 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:15:23,482 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-28 03:15:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:15:24,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:15:25,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:15:25,585 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 49 treesize of output 53 [2024-11-28 03:15:25,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:15:25,820 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 46 treesize of output 64 [2024-11-28 03:15:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:15:27,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103148007] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:15:27,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:15:27,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-28 03:15:27,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211279058] [2024-11-28 03:15:27,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:15:27,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 03:15:27,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:27,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:15:27,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:15:27,218 INFO L87 Difference]: Start difference. First operand 485 states and 677 transitions. Second operand has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 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-28 03:15:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:33,327 INFO L93 Difference]: Finished difference Result 632 states and 819 transitions. [2024-11-28 03:15:33,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:15:33,328 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 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-28 03:15:33,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:33,329 INFO L225 Difference]: With dead ends: 632 [2024-11-28 03:15:33,329 INFO L226 Difference]: Without dead ends: 632 [2024-11-28 03:15:33,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2024-11-28 03:15:33,330 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 1264 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:15:33,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1264 Valid, 309 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-28 03:15:33,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-28 03:15:33,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 481. [2024-11-28 03:15:33,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 440 states have (on average 1.5022727272727272) internal successors, (661), 480 states have internal predecessors, (661), 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-28 03:15:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 661 transitions. [2024-11-28 03:15:33,338 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 661 transitions. Word has length 44 [2024-11-28 03:15:33,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:33,339 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 661 transitions. [2024-11-28 03:15:33,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 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-28 03:15:33,339 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 661 transitions. [2024-11-28 03:15:33,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-28 03:15:33,339 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:33,340 INFO L218 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] [2024-11-28 03:15:33,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 03:15:33,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:15:33,540 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-11-28 03:15:33,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:33,540 INFO L85 PathProgramCache]: Analyzing trace with hash 766984195, now seen corresponding path program 1 times [2024-11-28 03:15:33,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:33,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070940040] [2024-11-28 03:15:33,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:33,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:43,103 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-28 03:15:43,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:43,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070940040] [2024-11-28 03:15:43,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070940040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:15:43,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193884360] [2024-11-28 03:15:43,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:43,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:15:43,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:15:43,106 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:15:43,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca300798-cb08-474d-81e0-ccbb241f56e0/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 03:15:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:43,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-28 03:15:43,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:15:43,392 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-28 03:15:43,923 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:15:43,923 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-28 03:15:44,459 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-28 03:15:44,484 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-28 03:15:45,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:15:45,897 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 36 [2024-11-28 03:15:45,920 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-28 03:15:46,394 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:15:46,395 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-28 03:15:46,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 03:15:47,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-28 03:15:47,446 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-28 03:15:48,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:15:48,434 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 56 [2024-11-28 03:15:48,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2024-11-28 03:15:53,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:15:53,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:15:53,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 27 [2024-11-28 03:15:53,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2024-11-28 03:15:54,306 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-28 03:15:54,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:16:00,008 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (forall ((v_ArrVal_2341 (Array Int Int)) (v_ArrVal_2340 (Array Int Int))) (<= 0 (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_2341)) (.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_2340))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4)) (.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4))) (let ((.cse0 (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 |c_ULTIMATE.start_main_~tmpList~0#1.offset|)))) (select (select .cse0 (select (select (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 |c_ULTIMATE.start_main_~tmpList~0#1.base|)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4)) (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4))))))) (forall ((v_ArrVal_2341 (Array Int Int)) (v_ArrVal_2340 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_2341)) (.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_2340))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4)) (.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4))) (let ((.cse6 (store .cse13 .cse11 (store (select .cse13 .cse11) .cse12 |c_ULTIMATE.start_main_~tmpList~0#1.offset|))) (.cse9 (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 |c_ULTIMATE.start_main_~tmpList~0#1.base|)))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4))) (<= (+ (select (select .cse6 .cse7) .cse8) 4) (select |c_#length| (select (select .cse9 .cse7) .cse8)))))))))) is different from false [2024-11-28 03:16:00,276 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 860 treesize of output 719 [2024-11-28 03:16:12,742 INFO L349 Elim1Store]: treesize reduction 57, result has 61.5 percent of original size [2024-11-28 03:16:12,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 1432 treesize of output 837 [2024-11-28 03:16:12,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:16:12,827 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 706 treesize of output 527 [2024-11-28 03:16:36,492 WARN L286 SmtUtils]: Spent 23.24s on a formula simplification. DAG size of input: 241 DAG size of output: 165 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-28 03:16:36,493 INFO L349 Elim1Store]: treesize reduction 791, result has 62.6 percent of original size [2024-11-28 03:16:36,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 12 new quantified variables, introduced 45 case distinctions, treesize of input 14300813 treesize of output 13111879 [2024-11-28 03:17:23,754 WARN L286 SmtUtils]: Spent 41.69s on a formula simplification. DAG size of input: 810 DAG size of output: 183 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-28 03:17:23,755 INFO L349 Elim1Store]: treesize reduction 3104, result has 11.3 percent of original size [2024-11-28 03:17:23,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 23 new quantified variables, introduced 138 case distinctions, treesize of input 12597857 treesize of output 12397910 [2024-11-28 03:17:48,547 WARN L286 SmtUtils]: Spent 24.74s on a formula simplification. DAG size of input: 16119 DAG size of output: 2745 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:17:50,220 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 32626 treesize of output 32326 [2024-11-28 03:17:52,805 INFO L224 Elim1Store]: Index analysis took 439 ms [2024-11-28 03:18:02,485 WARN L286 SmtUtils]: Spent 9.67s on a formula simplification. DAG size of input: 176 DAG size of output: 108 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-28 03:18:02,485 INFO L349 Elim1Store]: treesize reduction 374, result has 51.4 percent of original size [2024-11-28 03:18:02,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 60152 treesize of output 58266 [2024-11-28 03:18:05,306 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 32159 treesize of output 31683 [2024-11-28 03:18:09,138 INFO L224 Elim1Store]: Index analysis took 220 ms [2024-11-28 03:18:10,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:18:10,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 30975 treesize of output 31015 [2024-11-28 03:18:16,928 INFO L224 Elim1Store]: Index analysis took 910 ms [2024-11-28 03:18:34,446 WARN L286 SmtUtils]: Spent 17.15s on a formula simplification. DAG size of input: 455 DAG size of output: 118 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-28 03:18:34,447 INFO L349 Elim1Store]: treesize reduction 2231, result has 11.0 percent of original size [2024-11-28 03:18:34,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 68 case distinctions, treesize of input 608082 treesize of output 549278 [2024-11-28 03:18:58,069 WARN L286 SmtUtils]: Spent 23.60s on a formula simplification. DAG size of input: 5622 DAG size of output: 3875 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:19:03,675 INFO L224 Elim1Store]: Index analysis took 404 ms [2024-11-28 03:19:12,458 WARN L286 SmtUtils]: Spent 8.77s on a formula simplification. DAG size of input: 174 DAG size of output: 106 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-28 03:19:12,459 INFO L349 Elim1Store]: treesize reduction 329, result has 49.9 percent of original size [2024-11-28 03:19:12,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 36 case distinctions, treesize of input 101217 treesize of output 95362 [2024-11-28 03:19:23,431 WARN L286 SmtUtils]: Spent 10.96s on a formula simplification. DAG size of input: 3998 DAG size of output: 3991 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:19:28,519 WARN L286 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 3980 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:19:29,626 INFO L224 Elim1Store]: Index analysis took 520 ms [2024-11-28 03:19:41,029 WARN L286 SmtUtils]: Spent 11.39s on a formula simplification. DAG size of input: 174 DAG size of output: 114 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-28 03:19:41,029 INFO L349 Elim1Store]: treesize reduction 302, result has 54.0 percent of original size [2024-11-28 03:19:41,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 36 case distinctions, treesize of input 118495 treesize of output 111819 [2024-11-28 03:19:51,009 WARN L286 SmtUtils]: Spent 9.97s on a formula simplification. DAG size of input: 4118 DAG size of output: 4107 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:19:56,974 WARN L286 SmtUtils]: Spent 5.94s on a formula simplification that was a NOOP. DAG size: 4096 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:19:57,578 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 247438 treesize of output 220714 [2024-11-28 03:20:08,315 WARN L286 SmtUtils]: Spent 10.73s on a formula simplification. DAG size of input: 4233 DAG size of output: 4164 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:20:09,437 INFO L224 Elim1Store]: Index analysis took 370 ms [2024-11-28 03:20:17,697 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification. DAG size of input: 106 DAG size of output: 90 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-28 03:20:17,697 INFO L349 Elim1Store]: treesize reduction 63, result has 78.2 percent of original size [2024-11-28 03:20:17,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 98884 treesize of output 91984 [2024-11-28 03:20:33,534 WARN L286 SmtUtils]: Spent 15.82s on a formula simplification. DAG size of input: 4293 DAG size of output: 4278 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:20:42,138 WARN L286 SmtUtils]: Spent 8.58s on a formula simplification that was a NOOP. DAG size: 4263 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:20:43,167 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 299004 treesize of output 276216 [2024-11-28 03:21:05,428 WARN L286 SmtUtils]: Spent 22.24s on a formula simplification. DAG size of input: 4350 DAG size of output: 4280 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:21:06,628 INFO L224 Elim1Store]: Index analysis took 358 ms [2024-11-28 03:21:15,279 WARN L286 SmtUtils]: Spent 8.64s on a formula simplification. DAG size of input: 106 DAG size of output: 90 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-28 03:21:15,279 INFO L349 Elim1Store]: treesize reduction 63, result has 78.2 percent of original size [2024-11-28 03:21:15,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 118993 treesize of output 109041 [2024-11-28 03:21:34,913 WARN L286 SmtUtils]: Spent 19.62s on a formula simplification. DAG size of input: 4400 DAG size of output: 4385 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)