./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.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_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/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_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/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_f1697454-4c48-41ed-ba0e-682a825564f3/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 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:16:45,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:16:45,788 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 04:16:45,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:16:45,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:16:45,829 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:16:45,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:16:45,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:16:45,831 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:16:45,831 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:16:45,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:16:45,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:16:45,832 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:16:45,833 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:16:45,833 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:16:45,833 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:16:45,833 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:16:45,833 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:16:45,834 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:16:45,834 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:16:45,834 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 04:16:45,834 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 04:16:45,834 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 04:16:45,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:16:45,834 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 04:16:45,835 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 04:16:45,835 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:16:45,835 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:16:45,835 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:16:45,835 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:16:45,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:16:45,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:16:45,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:16:45,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:16:45,836 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:16:45,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:16:45,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:16:45,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:16:45,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:16:45,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:16:45,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:16:45,836 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:16:45,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:16:45,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:16:45,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:16:45,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:16:45,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:16:45,838 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_f1697454-4c48-41ed-ba0e-682a825564f3/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 -> 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 [2024-11-28 04:16:46,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:16:46,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:16:46,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:16:46,264 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:16:46,265 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:16:46,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2024-11-28 04:16:49,505 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/data/8ae32cbf6/f98594ab8c984a7ea7263aa7d3a4a6c1/FLAGe75b7397f [2024-11-28 04:16:49,949 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:16:49,950 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2024-11-28 04:16:49,972 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/data/8ae32cbf6/f98594ab8c984a7ea7263aa7d3a4a6c1/FLAGe75b7397f [2024-11-28 04:16:49,998 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/data/8ae32cbf6/f98594ab8c984a7ea7263aa7d3a4a6c1 [2024-11-28 04:16:50,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:16:50,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:16:50,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:16:50,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:16:50,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:16:50,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:16:49" (1/1) ... [2024-11-28 04:16:50,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d77e189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:50, skipping insertion in model container [2024-11-28 04:16:50,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:16:49" (1/1) ... [2024-11-28 04:16:50,073 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:16:50,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:16:50,512 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:16:50,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:16:50,611 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:16:50,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:50 WrapperNode [2024-11-28 04:16:50,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:16:50,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:16:50,613 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:16:50,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:16:50,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:50" (1/1) ... [2024-11-28 04:16:50,632 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:50" (1/1) ... [2024-11-28 04:16:50,674 INFO L138 Inliner]: procedures = 119, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 150 [2024-11-28 04:16:50,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:16:50,680 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:16:50,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:16:50,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:16:50,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:50" (1/1) ... [2024-11-28 04:16:50,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:50" (1/1) ... [2024-11-28 04:16:50,694 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:50" (1/1) ... [2024-11-28 04:16:50,711 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [2, 27]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 12 writes are split as follows [0, 12]. [2024-11-28 04:16:50,712 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:50" (1/1) ... [2024-11-28 04:16:50,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:50" (1/1) ... [2024-11-28 04:16:50,728 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:50" (1/1) ... [2024-11-28 04:16:50,729 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:50" (1/1) ... [2024-11-28 04:16:50,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:50" (1/1) ... [2024-11-28 04:16:50,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:50" (1/1) ... [2024-11-28 04:16:50,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:50" (1/1) ... [2024-11-28 04:16:50,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:16:50,742 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:16:50,742 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:16:50,742 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:16:50,743 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:50" (1/1) ... [2024-11-28 04:16:50,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:16:50,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:16:50,783 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:16:50,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:16:50,826 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-28 04:16:50,826 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-28 04:16:50,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 04:16:50,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 04:16:50,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 04:16:50,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 04:16:50,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 04:16:50,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:16:50,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 04:16:50,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 04:16:50,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 04:16:50,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 04:16:50,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 04:16:50,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 04:16:50,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 04:16:50,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:16:50,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:16:50,986 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:16:50,989 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:16:51,705 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-28 04:16:51,705 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:16:51,726 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:16:51,729 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-28 04:16:51,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:16:51 BoogieIcfgContainer [2024-11-28 04:16:51,729 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:16:51,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:16:51,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:16:51,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:16:51,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:16:49" (1/3) ... [2024-11-28 04:16:51,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584ca049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:16:51, skipping insertion in model container [2024-11-28 04:16:51,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:50" (2/3) ... [2024-11-28 04:16:51,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584ca049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:16:51, skipping insertion in model container [2024-11-28 04:16:51,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:16:51" (3/3) ... [2024-11-28 04:16:51,743 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2024-11-28 04:16:51,759 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:16:51,761 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-rb-cnstr_1-1.i that has 2 procedures, 162 locations, 1 initial locations, 10 loop locations, and 65 error locations. [2024-11-28 04:16:51,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:16:51,838 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;@51d7f483, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:16:51,838 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2024-11-28 04:16:51,843 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 88 states have (on average 2.090909090909091) internal successors, (184), 153 states have internal predecessors, (184), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-28 04:16:51,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 04:16:51,849 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:16:51,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 04:16:51,850 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:16:51,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:16:51,858 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-28 04:16:51,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:16:51,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588144394] [2024-11-28 04:16:51,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:16:51,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:16:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:16:52,125 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 04:16:52,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:16:52,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588144394] [2024-11-28 04:16:52,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588144394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:16:52,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:16:52,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:16:52,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007827344] [2024-11-28 04:16:52,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:16:52,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:16:52,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:16:52,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:16:52,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:16:52,179 INFO L87 Difference]: Start difference. First operand has 162 states, 88 states have (on average 2.090909090909091) internal successors, (184), 153 states have internal predecessors, (184), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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 04:16:52,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:16:52,542 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2024-11-28 04:16:52,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:16:52,545 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 04:16:52,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:16:52,554 INFO L225 Difference]: With dead ends: 148 [2024-11-28 04:16:52,554 INFO L226 Difference]: Without dead ends: 146 [2024-11-28 04:16:52,557 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 04:16:52,560 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 118 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:16:52,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 102 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 04:16:52,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-28 04:16:52,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-28 04:16:52,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 81 states have (on average 1.876543209876543) internal successors, (152), 144 states have internal predecessors, (152), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:16:52,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2024-11-28 04:16:52,609 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 3 [2024-11-28 04:16:52,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:16:52,610 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2024-11-28 04:16:52,610 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 04:16:52,611 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2024-11-28 04:16:52,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 04:16:52,611 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:16:52,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 04:16:52,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 04:16:52,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:16:52,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:16:52,612 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-28 04:16:52,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:16:52,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414690183] [2024-11-28 04:16:52,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:16:52,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:16:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:16:52,765 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 04:16:52,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:16:52,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414690183] [2024-11-28 04:16:52,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414690183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:16:52,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:16:52,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:16:52,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294786361] [2024-11-28 04:16:52,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:16:52,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:16:52,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:16:52,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:16:52,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:16:52,769 INFO L87 Difference]: Start difference. First operand 146 states and 159 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 04:16:53,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:16:53,004 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2024-11-28 04:16:53,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:16:53,005 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 04:16:53,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:16:53,007 INFO L225 Difference]: With dead ends: 150 [2024-11-28 04:16:53,008 INFO L226 Difference]: Without dead ends: 150 [2024-11-28 04:16:53,008 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 04:16:53,009 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 112 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:16:53,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 113 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:16:53,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-28 04:16:53,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-28 04:16:53,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 88 states have (on average 1.7727272727272727) internal successors, (156), 148 states have internal predecessors, (156), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:16:53,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2024-11-28 04:16:53,034 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 3 [2024-11-28 04:16:53,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:16:53,034 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2024-11-28 04:16:53,035 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 04:16:53,035 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2024-11-28 04:16:53,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 04:16:53,035 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:16:53,035 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:16:53,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 04:16:53,036 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:16:53,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:16:53,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1570703282, now seen corresponding path program 1 times [2024-11-28 04:16:53,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:16:53,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801806908] [2024-11-28 04:16:53,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:16:53,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:16:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:16:53,424 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 04:16:53,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:16:53,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801806908] [2024-11-28 04:16:53,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801806908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:16:53,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:16:53,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:16:53,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9716510] [2024-11-28 04:16:53,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:16:53,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:16:53,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:16:53,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:16:53,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:16:53,426 INFO L87 Difference]: Start difference. First operand 150 states and 163 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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 04:16:53,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:16:53,764 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2024-11-28 04:16:53,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:16:53,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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 04:16:53,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:16:53,767 INFO L225 Difference]: With dead ends: 137 [2024-11-28 04:16:53,767 INFO L226 Difference]: Without dead ends: 137 [2024-11-28 04:16:53,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:16:53,768 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 155 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:16:53,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 84 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 04:16:53,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-28 04:16:53,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-28 04:16:53,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 90 states have (on average 1.6111111111111112) internal successors, (145), 135 states have internal predecessors, (145), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:16:53,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2024-11-28 04:16:53,787 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 10 [2024-11-28 04:16:53,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:16:53,788 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2024-11-28 04:16:53,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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 04:16:53,788 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2024-11-28 04:16:53,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 04:16:53,788 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:16:53,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:16:53,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 04:16:53,792 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:16:53,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:16:53,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1570703281, now seen corresponding path program 1 times [2024-11-28 04:16:53,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:16:53,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407136700] [2024-11-28 04:16:53,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:16:53,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:16:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:16:54,238 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 04:16:54,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:16:54,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407136700] [2024-11-28 04:16:54,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407136700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:16:54,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:16:54,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:16:54,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672129473] [2024-11-28 04:16:54,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:16:54,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:16:54,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:16:54,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:16:54,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:16:54,240 INFO L87 Difference]: Start difference. First operand 137 states and 152 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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 04:16:54,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:16:54,598 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2024-11-28 04:16:54,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:16:54,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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 04:16:54,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:16:54,600 INFO L225 Difference]: With dead ends: 151 [2024-11-28 04:16:54,602 INFO L226 Difference]: Without dead ends: 151 [2024-11-28 04:16:54,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:16:54,603 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 264 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:16:54,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 125 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 04:16:54,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-28 04:16:54,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2024-11-28 04:16:54,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 102 states have (on average 1.5588235294117647) internal successors, (159), 146 states have internal predecessors, (159), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:16:54,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 166 transitions. [2024-11-28 04:16:54,624 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 166 transitions. Word has length 10 [2024-11-28 04:16:54,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:16:54,624 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 166 transitions. [2024-11-28 04:16:54,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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 04:16:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 166 transitions. [2024-11-28 04:16:54,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 04:16:54,625 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:16:54,625 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:16:54,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 04:16:54,625 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:16:54,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:16:54,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1019304179, now seen corresponding path program 1 times [2024-11-28 04:16:54,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:16:54,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506829461] [2024-11-28 04:16:54,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:16:54,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:16:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:16:54,719 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 04:16:54,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:16:54,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506829461] [2024-11-28 04:16:54,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506829461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:16:54,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:16:54,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:16:54,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47232376] [2024-11-28 04:16:54,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:16:54,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:16:54,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:16:54,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:16:54,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:16:54,721 INFO L87 Difference]: Start difference. First operand 148 states and 166 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:16:54,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:16:54,953 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2024-11-28 04:16:54,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:16:54,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-28 04:16:54,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:16:54,955 INFO L225 Difference]: With dead ends: 154 [2024-11-28 04:16:54,955 INFO L226 Difference]: Without dead ends: 154 [2024-11-28 04:16:54,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 04:16:54,958 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 134 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:16:54,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 190 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:16:54,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-28 04:16:54,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 147. [2024-11-28 04:16:54,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 102 states have (on average 1.5294117647058822) internal successors, (156), 145 states have internal predecessors, (156), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:16:54,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 162 transitions. [2024-11-28 04:16:54,975 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 162 transitions. Word has length 13 [2024-11-28 04:16:54,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:16:54,975 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 162 transitions. [2024-11-28 04:16:54,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:16:54,976 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 162 transitions. [2024-11-28 04:16:54,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 04:16:54,976 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:16:54,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:16:54,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 04:16:54,977 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:16:54,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:16:54,978 INFO L85 PathProgramCache]: Analyzing trace with hash 847221851, now seen corresponding path program 1 times [2024-11-28 04:16:54,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:16:54,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607472516] [2024-11-28 04:16:54,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:16:54,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:16:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:16:55,227 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 04:16:55,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:16:55,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607472516] [2024-11-28 04:16:55,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607472516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:16:55,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:16:55,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:16:55,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386851761] [2024-11-28 04:16:55,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:16:55,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:16:55,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:16:55,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:16:55,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:16:55,233 INFO L87 Difference]: Start difference. First operand 147 states and 162 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states 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 04:16:55,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:16:55,492 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2024-11-28 04:16:55,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:16:55,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-11-28 04:16:55,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:16:55,494 INFO L225 Difference]: With dead ends: 146 [2024-11-28 04:16:55,494 INFO L226 Difference]: Without dead ends: 146 [2024-11-28 04:16:55,495 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 04:16:55,496 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 4 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:16:55,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 350 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:16:55,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-28 04:16:55,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-28 04:16:55,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.5098039215686274) internal successors, (154), 144 states have internal predecessors, (154), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:16:55,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 160 transitions. [2024-11-28 04:16:55,513 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 160 transitions. Word has length 13 [2024-11-28 04:16:55,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:16:55,513 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 160 transitions. [2024-11-28 04:16:55,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states 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 04:16:55,514 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 160 transitions. [2024-11-28 04:16:55,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 04:16:55,514 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:16:55,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:16:55,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 04:16:55,515 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:16:55,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:16:55,515 INFO L85 PathProgramCache]: Analyzing trace with hash 847221852, now seen corresponding path program 1 times [2024-11-28 04:16:55,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:16:55,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567179759] [2024-11-28 04:16:55,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:16:55,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:16:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:16:55,878 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 04:16:55,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:16:55,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567179759] [2024-11-28 04:16:55,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567179759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:16:55,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:16:55,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:16:55,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948276354] [2024-11-28 04:16:55,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:16:55,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:16:55,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:16:55,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:16:55,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:16:55,880 INFO L87 Difference]: Start difference. First operand 146 states and 160 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states 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 04:16:56,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:16:56,157 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2024-11-28 04:16:56,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:16:56,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-11-28 04:16:56,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:16:56,160 INFO L225 Difference]: With dead ends: 145 [2024-11-28 04:16:56,160 INFO L226 Difference]: Without dead ends: 145 [2024-11-28 04:16:56,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:16:56,161 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 2 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:16:56,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 335 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:16:56,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-28 04:16:56,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-28 04:16:56,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 102 states have (on average 1.4901960784313726) internal successors, (152), 143 states have internal predecessors, (152), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:16:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2024-11-28 04:16:56,176 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 13 [2024-11-28 04:16:56,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:16:56,176 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2024-11-28 04:16:56,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states 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 04:16:56,177 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2024-11-28 04:16:56,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 04:16:56,177 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:16:56,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:16:56,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 04:16:56,178 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:16:56,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:16:56,178 INFO L85 PathProgramCache]: Analyzing trace with hash -137926412, now seen corresponding path program 1 times [2024-11-28 04:16:56,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:16:56,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044877205] [2024-11-28 04:16:56,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:16:56,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:16:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:16:56,404 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 04:16:56,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:16:56,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044877205] [2024-11-28 04:16:56,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044877205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:16:56,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:16:56,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:16:56,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272633331] [2024-11-28 04:16:56,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:16:56,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:16:56,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:16:56,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:16:56,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:16:56,406 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:16:56,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:16:56,699 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2024-11-28 04:16:56,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:16:56,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-28 04:16:56,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:16:56,701 INFO L225 Difference]: With dead ends: 185 [2024-11-28 04:16:56,701 INFO L226 Difference]: Without dead ends: 185 [2024-11-28 04:16:56,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:16:56,702 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 209 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:16:56,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 337 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:16:56,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-28 04:16:56,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 150. [2024-11-28 04:16:56,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 107 states have (on average 1.4672897196261683) internal successors, (157), 148 states have internal predecessors, (157), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:16:56,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2024-11-28 04:16:56,711 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 16 [2024-11-28 04:16:56,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:16:56,711 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2024-11-28 04:16:56,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:16:56,711 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2024-11-28 04:16:56,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 04:16:56,713 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:16:56,713 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 04:16:56,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 04:16:56,714 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:16:56,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:16:56,717 INFO L85 PathProgramCache]: Analyzing trace with hash 94244445, now seen corresponding path program 1 times [2024-11-28 04:16:56,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:16:56,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982312181] [2024-11-28 04:16:56,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:16:56,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:16:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:16:57,194 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 04:16:57,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:16:57,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982312181] [2024-11-28 04:16:57,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982312181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:16:57,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:16:57,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 04:16:57,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850816260] [2024-11-28 04:16:57,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:16:57,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 04:16:57,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:16:57,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 04:16:57,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:16:57,197 INFO L87 Difference]: Start difference. First operand 150 states and 163 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 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 04:16:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:16:57,735 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2024-11-28 04:16:57,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:16:57,736 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 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 04:16:57,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:16:57,737 INFO L225 Difference]: With dead ends: 149 [2024-11-28 04:16:57,737 INFO L226 Difference]: Without dead ends: 149 [2024-11-28 04:16:57,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-28 04:16:57,738 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 148 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:16:57,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 218 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 04:16:57,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-28 04:16:57,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-28 04:16:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 107 states have (on average 1.4579439252336448) internal successors, (156), 147 states have internal predecessors, (156), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:16:57,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2024-11-28 04:16:57,746 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 17 [2024-11-28 04:16:57,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:16:57,746 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2024-11-28 04:16:57,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 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 04:16:57,747 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2024-11-28 04:16:57,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 04:16:57,747 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:16:57,747 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 04:16:57,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 04:16:57,748 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:16:57,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:16:57,749 INFO L85 PathProgramCache]: Analyzing trace with hash 94244446, now seen corresponding path program 1 times [2024-11-28 04:16:57,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:16:57,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755088323] [2024-11-28 04:16:57,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:16:57,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:16:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:16:58,466 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 04:16:58,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:16:58,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755088323] [2024-11-28 04:16:58,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755088323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:16:58,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:16:58,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 04:16:58,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810453274] [2024-11-28 04:16:58,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:16:58,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 04:16:58,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:16:58,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 04:16:58,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:16:58,469 INFO L87 Difference]: Start difference. First operand 149 states and 162 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 11 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 04:16:59,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:16:59,262 INFO L93 Difference]: Finished difference Result 189 states and 209 transitions. [2024-11-28 04:16:59,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:16:59,262 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 11 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 04:16:59,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:16:59,263 INFO L225 Difference]: With dead ends: 189 [2024-11-28 04:16:59,263 INFO L226 Difference]: Without dead ends: 189 [2024-11-28 04:16:59,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-11-28 04:16:59,264 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 196 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:16:59,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 329 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 04:16:59,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-28 04:16:59,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 179. [2024-11-28 04:16:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 137 states have (on average 1.4087591240875912) internal successors, (193), 177 states have internal predecessors, (193), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:16:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 199 transitions. [2024-11-28 04:16:59,272 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 199 transitions. Word has length 17 [2024-11-28 04:16:59,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:16:59,272 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 199 transitions. [2024-11-28 04:16:59,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 11 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 04:16:59,272 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 199 transitions. [2024-11-28 04:16:59,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-28 04:16:59,273 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:16:59,273 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] [2024-11-28 04:16:59,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 04:16:59,274 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:16:59,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:16:59,274 INFO L85 PathProgramCache]: Analyzing trace with hash -495518145, now seen corresponding path program 1 times [2024-11-28 04:16:59,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:16:59,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051337861] [2024-11-28 04:16:59,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:16:59,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:16:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:16:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:16:59,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:16:59,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051337861] [2024-11-28 04:16:59,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051337861] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:16:59,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115217077] [2024-11-28 04:16:59,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:16:59,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:16:59,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:16:59,572 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:16:59,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:16:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:16:59,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-28 04:16:59,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:16:59,733 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 04:16:59,743 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 04:16:59,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 23 treesize of output 11 [2024-11-28 04:16:59,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 04:16:59,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 04:16:59,876 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 30 treesize of output 21 [2024-11-28 04:17:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:17:00,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:17:00,642 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 10 treesize of output 8 [2024-11-28 04:17:00,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-28 04:17:00,664 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 10 treesize of output 8 [2024-11-28 04:17:00,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:17:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:17:00,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115217077] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:17:00,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:17:00,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 13 [2024-11-28 04:17:00,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472529660] [2024-11-28 04:17:00,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:17:00,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 04:17:00,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:17:00,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 04:17:00,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-28 04:17:00,692 INFO L87 Difference]: Start difference. First operand 179 states and 199 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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 04:17:01,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:17:01,418 INFO L93 Difference]: Finished difference Result 216 states and 242 transitions. [2024-11-28 04:17:01,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 04:17:01,419 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 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 21 [2024-11-28 04:17:01,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:17:01,421 INFO L225 Difference]: With dead ends: 216 [2024-11-28 04:17:01,422 INFO L226 Difference]: Without dead ends: 216 [2024-11-28 04:17:01,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-11-28 04:17:01,423 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 370 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:17:01,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 549 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 04:17:01,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-28 04:17:01,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 186. [2024-11-28 04:17:01,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 144 states have (on average 1.3958333333333333) internal successors, (201), 184 states have internal predecessors, (201), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 207 transitions. [2024-11-28 04:17:01,433 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 207 transitions. Word has length 21 [2024-11-28 04:17:01,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:17:01,433 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 207 transitions. [2024-11-28 04:17:01,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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 04:17:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 207 transitions. [2024-11-28 04:17:01,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-28 04:17:01,435 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:17:01,435 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] [2024-11-28 04:17:01,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 04:17:01,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:17:01,641 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:17:01,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:17:01,642 INFO L85 PathProgramCache]: Analyzing trace with hash -549464901, now seen corresponding path program 1 times [2024-11-28 04:17:01,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:17:01,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725400849] [2024-11-28 04:17:01,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:01,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:17:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:01,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:17:01,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:17:01,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725400849] [2024-11-28 04:17:01,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725400849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:17:01,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:17:01,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:17:01,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802831655] [2024-11-28 04:17:01,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:17:01,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:17:01,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:17:01,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:17:01,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:17:01,734 INFO L87 Difference]: Start difference. First operand 186 states and 207 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:02,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:17:02,003 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2024-11-28 04:17:02,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:17:02,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-28 04:17:02,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:17:02,005 INFO L225 Difference]: With dead ends: 185 [2024-11-28 04:17:02,005 INFO L226 Difference]: Without dead ends: 185 [2024-11-28 04:17:02,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 04:17:02,006 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 19 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:17:02,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 354 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:17:02,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-28 04:17:02,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-28 04:17:02,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 143 states have (on average 1.3846153846153846) internal successors, (198), 183 states have internal predecessors, (198), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:02,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 204 transitions. [2024-11-28 04:17:02,017 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 204 transitions. Word has length 23 [2024-11-28 04:17:02,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:17:02,017 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 204 transitions. [2024-11-28 04:17:02,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:02,017 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 204 transitions. [2024-11-28 04:17:02,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-28 04:17:02,018 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:17:02,019 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] [2024-11-28 04:17:02,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 04:17:02,020 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:17:02,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:17:02,020 INFO L85 PathProgramCache]: Analyzing trace with hash -879363772, now seen corresponding path program 1 times [2024-11-28 04:17:02,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:17:02,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064212456] [2024-11-28 04:17:02,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:02,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:17:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:02,131 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 04:17:02,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:17:02,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064212456] [2024-11-28 04:17:02,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064212456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:17:02,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:17:02,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:17:02,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580247974] [2024-11-28 04:17:02,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:17:02,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:17:02,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:17:02,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:17:02,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:17:02,134 INFO L87 Difference]: Start difference. First operand 185 states and 204 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:02,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:17:02,283 INFO L93 Difference]: Finished difference Result 184 states and 201 transitions. [2024-11-28 04:17:02,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:17:02,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-28 04:17:02,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:17:02,285 INFO L225 Difference]: With dead ends: 184 [2024-11-28 04:17:02,285 INFO L226 Difference]: Without dead ends: 184 [2024-11-28 04:17:02,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 04:17:02,286 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 16 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:17:02,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 303 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:17:02,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-28 04:17:02,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-11-28 04:17:02,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 143 states have (on average 1.3706293706293706) internal successors, (196), 182 states have internal predecessors, (196), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:02,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 201 transitions. [2024-11-28 04:17:02,294 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 201 transitions. Word has length 25 [2024-11-28 04:17:02,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:17:02,295 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 201 transitions. [2024-11-28 04:17:02,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:02,295 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 201 transitions. [2024-11-28 04:17:02,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-28 04:17:02,297 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:17:02,297 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] [2024-11-28 04:17:02,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 04:17:02,298 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:17:02,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:17:02,299 INFO L85 PathProgramCache]: Analyzing trace with hash -617859954, now seen corresponding path program 1 times [2024-11-28 04:17:02,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:17:02,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343892684] [2024-11-28 04:17:02,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:02,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:17:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:02,477 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 04:17:02,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:17:02,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343892684] [2024-11-28 04:17:02,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343892684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:17:02,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:17:02,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:17:02,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558886537] [2024-11-28 04:17:02,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:17:02,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:17:02,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:17:02,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:17:02,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:17:02,479 INFO L87 Difference]: Start difference. First operand 184 states and 201 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:02,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:17:02,724 INFO L93 Difference]: Finished difference Result 183 states and 199 transitions. [2024-11-28 04:17:02,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:17:02,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-28 04:17:02,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:17:02,726 INFO L225 Difference]: With dead ends: 183 [2024-11-28 04:17:02,726 INFO L226 Difference]: Without dead ends: 183 [2024-11-28 04:17:02,726 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 04:17:02,726 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 4 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:17:02,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 336 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:17:02,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-28 04:17:02,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2024-11-28 04:17:02,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 181 states have internal predecessors, (194), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:02,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 199 transitions. [2024-11-28 04:17:02,753 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 199 transitions. Word has length 25 [2024-11-28 04:17:02,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:17:02,755 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 199 transitions. [2024-11-28 04:17:02,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:02,756 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 199 transitions. [2024-11-28 04:17:02,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-28 04:17:02,756 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:17:02,756 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] [2024-11-28 04:17:02,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 04:17:02,757 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:17:02,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:17:02,759 INFO L85 PathProgramCache]: Analyzing trace with hash -617859953, now seen corresponding path program 1 times [2024-11-28 04:17:02,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:17:02,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854394058] [2024-11-28 04:17:02,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:02,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:17:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:03,005 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 04:17:03,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:17:03,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854394058] [2024-11-28 04:17:03,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854394058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:17:03,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:17:03,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:17:03,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542297339] [2024-11-28 04:17:03,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:17:03,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:17:03,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:17:03,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:17:03,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:17:03,010 INFO L87 Difference]: Start difference. First operand 183 states and 199 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:03,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:17:03,234 INFO L93 Difference]: Finished difference Result 182 states and 197 transitions. [2024-11-28 04:17:03,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:17:03,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-28 04:17:03,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:17:03,235 INFO L225 Difference]: With dead ends: 182 [2024-11-28 04:17:03,235 INFO L226 Difference]: Without dead ends: 182 [2024-11-28 04:17:03,236 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 04:17:03,236 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 2 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:17:03,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 319 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:17:03,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-28 04:17:03,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2024-11-28 04:17:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 143 states have (on average 1.3426573426573427) internal successors, (192), 180 states have internal predecessors, (192), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:03,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 197 transitions. [2024-11-28 04:17:03,248 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 197 transitions. Word has length 25 [2024-11-28 04:17:03,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:17:03,248 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 197 transitions. [2024-11-28 04:17:03,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:03,249 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 197 transitions. [2024-11-28 04:17:03,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 04:17:03,249 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:17:03,249 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 04:17:03,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 04:17:03,249 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:17:03,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:17:03,250 INFO L85 PathProgramCache]: Analyzing trace with hash -386657288, now seen corresponding path program 1 times [2024-11-28 04:17:03,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:17:03,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878762081] [2024-11-28 04:17:03,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:03,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:17:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:03,450 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 04:17:03,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:17:03,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878762081] [2024-11-28 04:17:03,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878762081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:17:03,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:17:03,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:17:03,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679878339] [2024-11-28 04:17:03,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:17:03,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:17:03,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:17:03,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:17:03,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:17:03,452 INFO L87 Difference]: Start difference. First operand 182 states and 197 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:03,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:17:03,611 INFO L93 Difference]: Finished difference Result 181 states and 194 transitions. [2024-11-28 04:17:03,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:17:03,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-28 04:17:03,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:17:03,613 INFO L225 Difference]: With dead ends: 181 [2024-11-28 04:17:03,613 INFO L226 Difference]: Without dead ends: 181 [2024-11-28 04:17:03,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 04:17:03,614 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 12 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:17:03,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 272 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:17:03,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-28 04:17:03,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-11-28 04:17:03,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 143 states have (on average 1.3286713286713288) internal successors, (190), 179 states have internal predecessors, (190), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:03,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 194 transitions. [2024-11-28 04:17:03,620 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 194 transitions. Word has length 28 [2024-11-28 04:17:03,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:17:03,620 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 194 transitions. [2024-11-28 04:17:03,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:03,621 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 194 transitions. [2024-11-28 04:17:03,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-28 04:17:03,621 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:17:03,621 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] [2024-11-28 04:17:03,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 04:17:03,622 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:17:03,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:17:03,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1162615175, now seen corresponding path program 1 times [2024-11-28 04:17:03,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:17:03,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575524986] [2024-11-28 04:17:03,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:03,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:17:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:03,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:17:03,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:17:03,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575524986] [2024-11-28 04:17:03,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575524986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:17:03,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:17:03,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:17:03,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017493594] [2024-11-28 04:17:03,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:17:03,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:17:03,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:17:03,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:17:03,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:17:03,663 INFO L87 Difference]: Start difference. First operand 181 states and 194 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:03,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:17:03,722 INFO L93 Difference]: Finished difference Result 183 states and 196 transitions. [2024-11-28 04:17:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:17:03,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-28 04:17:03,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:17:03,724 INFO L225 Difference]: With dead ends: 183 [2024-11-28 04:17:03,724 INFO L226 Difference]: Without dead ends: 183 [2024-11-28 04:17:03,724 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 04:17:03,724 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 71 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:17:03,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 128 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:17:03,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-28 04:17:03,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2024-11-28 04:17:03,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 145 states have (on average 1.3241379310344827) internal successors, (192), 181 states have internal predecessors, (192), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:03,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 196 transitions. [2024-11-28 04:17:03,730 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 196 transitions. Word has length 27 [2024-11-28 04:17:03,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:17:03,730 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 196 transitions. [2024-11-28 04:17:03,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:03,731 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 196 transitions. [2024-11-28 04:17:03,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 04:17:03,731 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:17:03,731 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 04:17:03,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 04:17:03,732 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:17:03,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:17:03,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2021263469, now seen corresponding path program 1 times [2024-11-28 04:17:03,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:17:03,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133038166] [2024-11-28 04:17:03,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:03,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:17:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:03,992 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 04:17:03,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:17:03,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133038166] [2024-11-28 04:17:03,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133038166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:17:03,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:17:03,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 04:17:03,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766163302] [2024-11-28 04:17:03,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:17:03,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:17:03,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:17:03,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:17:03,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:17:03,994 INFO L87 Difference]: Start difference. First operand 183 states and 196 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:04,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:17:04,701 INFO L93 Difference]: Finished difference Result 201 states and 219 transitions. [2024-11-28 04:17:04,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 04:17:04,702 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-28 04:17:04,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:17:04,703 INFO L225 Difference]: With dead ends: 201 [2024-11-28 04:17:04,703 INFO L226 Difference]: Without dead ends: 201 [2024-11-28 04:17:04,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-28 04:17:04,706 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 174 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:17:04,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 376 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 04:17:04,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-28 04:17:04,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 190. [2024-11-28 04:17:04,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 152 states have (on average 1.3157894736842106) internal successors, (200), 188 states have internal predecessors, (200), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:04,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 204 transitions. [2024-11-28 04:17:04,715 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 204 transitions. Word has length 30 [2024-11-28 04:17:04,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:17:04,716 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 204 transitions. [2024-11-28 04:17:04,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:04,717 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 204 transitions. [2024-11-28 04:17:04,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 04:17:04,718 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:17:04,718 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] [2024-11-28 04:17:04,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 04:17:04,719 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:17:04,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:17:04,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1238887632, now seen corresponding path program 1 times [2024-11-28 04:17:04,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:17:04,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564498354] [2024-11-28 04:17:04,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:04,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:17:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:05,224 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 04:17:05,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:17:05,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564498354] [2024-11-28 04:17:05,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564498354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:17:05,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:17:05,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 04:17:05,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536513561] [2024-11-28 04:17:05,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:17:05,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 04:17:05,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:17:05,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 04:17:05,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-28 04:17:05,227 INFO L87 Difference]: Start difference. First operand 190 states and 204 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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 04:17:05,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:17:05,959 INFO L93 Difference]: Finished difference Result 189 states and 203 transitions. [2024-11-28 04:17:05,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:17:05,959 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-28 04:17:05,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:17:05,960 INFO L225 Difference]: With dead ends: 189 [2024-11-28 04:17:05,960 INFO L226 Difference]: Without dead ends: 189 [2024-11-28 04:17:05,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2024-11-28 04:17:05,961 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 138 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:17:05,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 404 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 04:17:05,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-28 04:17:05,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2024-11-28 04:17:05,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 152 states have (on average 1.3092105263157894) internal successors, (199), 187 states have internal predecessors, (199), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:05,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 203 transitions. [2024-11-28 04:17:05,967 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 203 transitions. Word has length 29 [2024-11-28 04:17:05,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:17:05,967 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 203 transitions. [2024-11-28 04:17:05,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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 04:17:05,968 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 203 transitions. [2024-11-28 04:17:05,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 04:17:05,968 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:17:05,968 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] [2024-11-28 04:17:05,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 04:17:05,969 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:17:05,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:17:05,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1238887633, now seen corresponding path program 1 times [2024-11-28 04:17:05,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:17:05,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605890986] [2024-11-28 04:17:05,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:05,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:17:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:06,529 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 04:17:06,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:17:06,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605890986] [2024-11-28 04:17:06,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605890986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:17:06,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:17:06,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 04:17:06,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933589803] [2024-11-28 04:17:06,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:17:06,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 04:17:06,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:17:06,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 04:17:06,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-28 04:17:06,532 INFO L87 Difference]: Start difference. First operand 189 states and 203 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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 04:17:07,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:17:07,627 INFO L93 Difference]: Finished difference Result 198 states and 211 transitions. [2024-11-28 04:17:07,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 04:17:07,628 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-28 04:17:07,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:17:07,629 INFO L225 Difference]: With dead ends: 198 [2024-11-28 04:17:07,629 INFO L226 Difference]: Without dead ends: 198 [2024-11-28 04:17:07,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2024-11-28 04:17:07,630 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 154 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:17:07,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 548 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 04:17:07,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-28 04:17:07,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2024-11-28 04:17:07,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 152 states have (on average 1.2828947368421053) internal successors, (195), 185 states have internal predecessors, (195), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2024-11-28 04:17:07,638 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 29 [2024-11-28 04:17:07,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:17:07,638 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2024-11-28 04:17:07,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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 04:17:07,639 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2024-11-28 04:17:07,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 04:17:07,639 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:17:07,639 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] [2024-11-28 04:17:07,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 04:17:07,639 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:17:07,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:17:07,640 INFO L85 PathProgramCache]: Analyzing trace with hash 581696394, now seen corresponding path program 1 times [2024-11-28 04:17:07,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:17:07,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112635848] [2024-11-28 04:17:07,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:07,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:17:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:07,773 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 04:17:07,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:17:07,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112635848] [2024-11-28 04:17:07,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112635848] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:17:07,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001027207] [2024-11-28 04:17:07,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:07,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:17:07,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:17:07,776 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:17:07,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:17:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:07,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 04:17:07,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:17:07,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:17:08,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-28 04:17:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:17:08,021 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:17:08,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001027207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:17:08,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:17:08,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-28 04:17:08,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278264710] [2024-11-28 04:17:08,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:17:08,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:17:08,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:17:08,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:17:08,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:17:08,025 INFO L87 Difference]: Start difference. First operand 187 states and 199 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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 04:17:08,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:17:08,132 INFO L93 Difference]: Finished difference Result 193 states and 205 transitions. [2024-11-28 04:17:08,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:17:08,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-28 04:17:08,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:17:08,134 INFO L225 Difference]: With dead ends: 193 [2024-11-28 04:17:08,134 INFO L226 Difference]: Without dead ends: 193 [2024-11-28 04:17:08,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:17:08,135 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 6 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:17:08,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 305 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:17:08,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-28 04:17:08,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2024-11-28 04:17:08,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 155 states have (on average 1.2774193548387096) internal successors, (198), 188 states have internal predecessors, (198), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:08,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 202 transitions. [2024-11-28 04:17:08,143 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 202 transitions. Word has length 29 [2024-11-28 04:17:08,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:17:08,143 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 202 transitions. [2024-11-28 04:17:08,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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 04:17:08,143 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 202 transitions. [2024-11-28 04:17:08,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 04:17:08,144 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:17:08,144 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] [2024-11-28 04:17:08,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 04:17:08,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:17:08,348 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:17:08,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:17:08,349 INFO L85 PathProgramCache]: Analyzing trace with hash -759079811, now seen corresponding path program 1 times [2024-11-28 04:17:08,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:17:08,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415369417] [2024-11-28 04:17:08,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:08,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:17:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:08,642 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 04:17:08,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:17:08,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415369417] [2024-11-28 04:17:08,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415369417] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:17:08,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814602325] [2024-11-28 04:17:08,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:08,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:17:08,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:17:08,645 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:17:08,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 04:17:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:08,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-28 04:17:08,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:17:08,778 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 04:17:08,784 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 04:17:08,796 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 04:17:08,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-28 04:17:08,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:17:08,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2024-11-28 04:17:08,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-28 04:17:09,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:17:09,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:17:09,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:17:09,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814602325] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:17:09,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:17:09,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 10 [2024-11-28 04:17:09,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806631698] [2024-11-28 04:17:09,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:17:09,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:17:09,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:17:09,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:17:09,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:17:09,281 INFO L87 Difference]: Start difference. First operand 190 states and 202 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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 04:17:09,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:17:09,973 INFO L93 Difference]: Finished difference Result 211 states and 230 transitions. [2024-11-28 04:17:09,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 04:17:09,974 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 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 04:17:09,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:17:09,975 INFO L225 Difference]: With dead ends: 211 [2024-11-28 04:17:09,975 INFO L226 Difference]: Without dead ends: 211 [2024-11-28 04:17:09,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-11-28 04:17:09,978 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 22 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:17:09,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 540 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 04:17:09,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-28 04:17:09,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 201. [2024-11-28 04:17:09,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 166 states have (on average 1.2710843373493976) internal successors, (211), 199 states have internal predecessors, (211), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 215 transitions. [2024-11-28 04:17:09,988 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 215 transitions. Word has length 30 [2024-11-28 04:17:09,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:17:09,988 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 215 transitions. [2024-11-28 04:17:09,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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 04:17:09,989 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 215 transitions. [2024-11-28 04:17:09,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 04:17:09,990 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:17:09,990 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 04:17:10,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 04:17:10,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:17:10,195 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:17:10,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:17:10,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2056634151, now seen corresponding path program 1 times [2024-11-28 04:17:10,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:17:10,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746031495] [2024-11-28 04:17:10,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:10,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:17:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:17:10,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:17:10,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746031495] [2024-11-28 04:17:10,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746031495] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:17:10,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770854282] [2024-11-28 04:17:10,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:10,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:17:10,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:17:10,325 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:17:10,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 04:17:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:10,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-28 04:17:10,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:17:10,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:17:10,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:17:10,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:17:10,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:17:10,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770854282] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:17:10,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:17:10,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-11-28 04:17:10,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897722467] [2024-11-28 04:17:10,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:17:10,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:17:10,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:17:10,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:17:10,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:17:10,668 INFO L87 Difference]: Start difference. First operand 201 states and 215 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 04:17:10,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:17:10,902 INFO L93 Difference]: Finished difference Result 209 states and 222 transitions. [2024-11-28 04:17:10,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:17:10,903 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 31 [2024-11-28 04:17:10,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:17:10,904 INFO L225 Difference]: With dead ends: 209 [2024-11-28 04:17:10,904 INFO L226 Difference]: Without dead ends: 186 [2024-11-28 04:17:10,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:17:10,905 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:17:10,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 337 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:17:10,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-28 04:17:10,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-11-28 04:17:10,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 151 states have (on average 1.2913907284768211) internal successors, (195), 184 states have internal predecessors, (195), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 199 transitions. [2024-11-28 04:17:10,913 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 199 transitions. Word has length 31 [2024-11-28 04:17:10,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:17:10,913 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 199 transitions. [2024-11-28 04:17:10,914 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 04:17:10,914 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 199 transitions. [2024-11-28 04:17:10,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-28 04:17:10,914 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:17:10,915 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 04:17:10,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 04:17:11,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-28 04:17:11,119 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:17:11,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:17:11,120 INFO L85 PathProgramCache]: Analyzing trace with hash -439464065, now seen corresponding path program 1 times [2024-11-28 04:17:11,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:17:11,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606340630] [2024-11-28 04:17:11,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:11,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:17:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:11,874 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 04:17:11,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:17:11,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606340630] [2024-11-28 04:17:11,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606340630] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:17:11,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814983774] [2024-11-28 04:17:11,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:11,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:17:11,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:17:11,878 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:17:11,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 04:17:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:12,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-28 04:17:12,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:17:12,051 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 04:17:12,078 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 04:17:12,185 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:17:12,185 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 04:17:12,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:17:12,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 04:17:12,259 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 04:17:12,525 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:17:12,526 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 41 treesize of output 38 [2024-11-28 04:17:12,535 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 04:17:12,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-28 04:17:12,592 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 04:17:12,625 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 04:17:12,722 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 04:17:12,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:17:12,777 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_907) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-28 04:17:12,798 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_907) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-28 04:17:12,808 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 (Array Int Int))) (= 1 (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_907) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2024-11-28 04:17:12,822 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_904 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (v_ArrVal_907 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_905) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_904) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_907) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-28 04:17:12,831 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_904 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (v_ArrVal_907 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int#1| .cse0 v_ArrVal_905) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_904) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_907)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-28 04:17:12,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:17:12,849 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 38 treesize of output 39 [2024-11-28 04:17:12,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2024-11-28 04:17:12,860 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 29 treesize of output 27 [2024-11-28 04:17:17,470 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:17:17,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:17:17,480 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 54 treesize of output 46 [2024-11-28 04:17:17,487 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 95 treesize of output 77 [2024-11-28 04:17:17,497 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 04:17:17,499 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 04:17:17,508 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:17:17,512 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-28 04:17:17,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2024-11-28 04:17:25,554 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 04:17:25,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814983774] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:17:25,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:17:25,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 29 [2024-11-28 04:17:25,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892731477] [2024-11-28 04:17:25,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:17:25,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-28 04:17:25,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:17:25,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-28 04:17:25,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=444, Unknown=13, NotChecked=240, Total=812 [2024-11-28 04:17:25,558 INFO L87 Difference]: Start difference. First operand 186 states and 199 transitions. Second operand has 29 states, 29 states have (on average 2.8620689655172415) internal successors, (83), 29 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:28,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:17:28,295 INFO L93 Difference]: Finished difference Result 281 states and 304 transitions. [2024-11-28 04:17:28,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 04:17:28,296 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.8620689655172415) internal successors, (83), 29 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-28 04:17:28,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:17:28,297 INFO L225 Difference]: With dead ends: 281 [2024-11-28 04:17:28,298 INFO L226 Difference]: Without dead ends: 281 [2024-11-28 04:17:28,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=334, Invalid=1154, Unknown=14, NotChecked=390, Total=1892 [2024-11-28 04:17:28,300 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 333 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 49 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 2012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 1059 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:17:28,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 639 Invalid, 2012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 896 Invalid, 8 Unknown, 1059 Unchecked, 1.7s Time] [2024-11-28 04:17:28,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-28 04:17:28,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 223. [2024-11-28 04:17:28,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 188 states have (on average 1.2872340425531914) internal successors, (242), 221 states have internal predecessors, (242), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:28,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 246 transitions. [2024-11-28 04:17:28,310 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 246 transitions. Word has length 38 [2024-11-28 04:17:28,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:17:28,310 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 246 transitions. [2024-11-28 04:17:28,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.8620689655172415) internal successors, (83), 29 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:28,311 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 246 transitions. [2024-11-28 04:17:28,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-28 04:17:28,311 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:17:28,311 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:17:28,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 04:17:28,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:17:28,512 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:17:28,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:17:28,513 INFO L85 PathProgramCache]: Analyzing trace with hash -663488205, now seen corresponding path program 1 times [2024-11-28 04:17:28,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:17:28,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110930786] [2024-11-28 04:17:28,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:28,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:17:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:29,158 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 04:17:29,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:17:29,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110930786] [2024-11-28 04:17:29,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110930786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:17:29,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:17:29,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 04:17:29,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440533695] [2024-11-28 04:17:29,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:17:29,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 04:17:29,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:17:29,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 04:17:29,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-28 04:17:29,160 INFO L87 Difference]: Start difference. First operand 223 states and 246 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:29,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:17:29,927 INFO L93 Difference]: Finished difference Result 213 states and 229 transitions. [2024-11-28 04:17:29,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 04:17:29,928 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-28 04:17:29,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:17:29,929 INFO L225 Difference]: With dead ends: 213 [2024-11-28 04:17:29,929 INFO L226 Difference]: Without dead ends: 213 [2024-11-28 04:17:29,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2024-11-28 04:17:29,930 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 154 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:17:29,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 402 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 04:17:29,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-28 04:17:29,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 165. [2024-11-28 04:17:29,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 141 states have (on average 1.2340425531914894) internal successors, (174), 163 states have internal predecessors, (174), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2024-11-28 04:17:29,936 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 39 [2024-11-28 04:17:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:17:29,937 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2024-11-28 04:17:29,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2024-11-28 04:17:29,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-28 04:17:29,938 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:17:29,938 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] [2024-11-28 04:17:29,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-28 04:17:29,938 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:17:29,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:17:29,939 INFO L85 PathProgramCache]: Analyzing trace with hash 671734200, now seen corresponding path program 1 times [2024-11-28 04:17:29,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:17:29,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695148080] [2024-11-28 04:17:29,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:29,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:17:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:30,523 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 04:17:30,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:17:30,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695148080] [2024-11-28 04:17:30,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695148080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:17:30,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:17:30,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 04:17:30,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66253690] [2024-11-28 04:17:30,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:17:30,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 04:17:30,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:17:30,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 04:17:30,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-28 04:17:30,525 INFO L87 Difference]: Start difference. First operand 165 states and 178 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:31,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:17:31,342 INFO L93 Difference]: Finished difference Result 175 states and 188 transitions. [2024-11-28 04:17:31,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 04:17:31,343 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-28 04:17:31,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:17:31,344 INFO L225 Difference]: With dead ends: 175 [2024-11-28 04:17:31,344 INFO L226 Difference]: Without dead ends: 175 [2024-11-28 04:17:31,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2024-11-28 04:17:31,345 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 147 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:17:31,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 502 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 04:17:31,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-28 04:17:31,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 157. [2024-11-28 04:17:31,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 134 states have (on average 1.2388059701492538) internal successors, (166), 155 states have internal predecessors, (166), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:31,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 169 transitions. [2024-11-28 04:17:31,351 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 169 transitions. Word has length 40 [2024-11-28 04:17:31,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:17:31,351 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 169 transitions. [2024-11-28 04:17:31,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 169 transitions. [2024-11-28 04:17:31,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-28 04:17:31,356 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:17:31,356 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, 1, 1, 1, 1] [2024-11-28 04:17:31,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 04:17:31,356 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:17:31,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:17:31,357 INFO L85 PathProgramCache]: Analyzing trace with hash 805402260, now seen corresponding path program 1 times [2024-11-28 04:17:31,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:17:31,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957051542] [2024-11-28 04:17:31,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:31,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:17:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:31,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:17:31,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:17:31,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957051542] [2024-11-28 04:17:31,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957051542] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:17:31,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746088606] [2024-11-28 04:17:31,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:31,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:17:31,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:17:31,983 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:17:31,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 04:17:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:32,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-28 04:17:32,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:17:32,180 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 04:17:32,307 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:17:32,307 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 04:17:32,350 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 04:17:32,465 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:17:32,466 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 25 treesize of output 26 [2024-11-28 04:17:32,606 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 04:17:32,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-28 04:17:32,704 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:17:32,704 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 34 treesize of output 33 [2024-11-28 04:17:33,014 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 04:17:33,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:17:33,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:17:33,557 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-11-28 04:17:33,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 04:17:33,950 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1137 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_87| Int) (v_ArrVal_1135 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_87| 0) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1135))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1137) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_87|)))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_87|))) is different from false [2024-11-28 04:17:33,973 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1137 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_87| Int) (v_ArrVal_1135 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_87| 0) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1135))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_1137) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_87|) .cse1))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_87|))) is different from false [2024-11-28 04:17:34,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:17:34,011 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 51 treesize of output 36 [2024-11-28 04:17:34,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:17:34,031 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 170 treesize of output 137 [2024-11-28 04:17:34,057 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 92 treesize of output 86 [2024-11-28 04:17:34,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:17:34,082 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 64 treesize of output 55 [2024-11-28 04:17:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:17:34,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746088606] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:17:34,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:17:34,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 35 [2024-11-28 04:17:34,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763134599] [2024-11-28 04:17:34,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:17:34,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-28 04:17:34,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:17:34,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-28 04:17:34,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1007, Unknown=10, NotChecked=130, Total=1260 [2024-11-28 04:17:34,712 INFO L87 Difference]: Start difference. First operand 157 states and 169 transitions. Second operand has 36 states, 35 states have (on average 3.4571428571428573) internal successors, (121), 36 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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 04:17:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:17:36,786 INFO L93 Difference]: Finished difference Result 246 states and 268 transitions. [2024-11-28 04:17:36,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 04:17:36,787 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.4571428571428573) internal successors, (121), 36 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-28 04:17:36,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:17:36,789 INFO L225 Difference]: With dead ends: 246 [2024-11-28 04:17:36,789 INFO L226 Difference]: Without dead ends: 246 [2024-11-28 04:17:36,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=270, Invalid=1708, Unknown=10, NotChecked=174, Total=2162 [2024-11-28 04:17:36,791 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 682 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 2117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 415 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:17:36,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 833 Invalid, 2117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1607 Invalid, 0 Unknown, 415 Unchecked, 1.5s Time] [2024-11-28 04:17:36,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-28 04:17:36,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 192. [2024-11-28 04:17:36,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 169 states have (on average 1.21301775147929) internal successors, (205), 190 states have internal predecessors, (205), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:36,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 208 transitions. [2024-11-28 04:17:36,799 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 208 transitions. Word has length 43 [2024-11-28 04:17:36,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:17:36,799 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 208 transitions. [2024-11-28 04:17:36,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.4571428571428573) internal successors, (121), 36 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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 04:17:36,800 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 208 transitions. [2024-11-28 04:17:36,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-28 04:17:36,800 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:17:36,801 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, 1, 1, 1, 1] [2024-11-28 04:17:36,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 04:17:37,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:17:37,002 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:17:37,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:17:37,002 INFO L85 PathProgramCache]: Analyzing trace with hash 805402261, now seen corresponding path program 1 times [2024-11-28 04:17:37,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:17:37,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640339255] [2024-11-28 04:17:37,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:37,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:17:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:17:37,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:17:37,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640339255] [2024-11-28 04:17:37,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640339255] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:17:37,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301080891] [2024-11-28 04:17:37,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:37,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:17:37,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:17:37,775 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:17:37,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 04:17:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:37,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-28 04:17:37,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:17:37,949 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 04:17:38,056 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:17:38,056 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 04:17:38,095 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 04:17:38,106 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 04:17:38,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:17:38,241 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 46 treesize of output 32 [2024-11-28 04:17:38,248 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 04:17:38,512 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:17:38,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 04:17:38,551 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2024-11-28 04:17:38,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 29 [2024-11-28 04:17:38,561 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 04:17:38,663 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:17:38,663 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 50 treesize of output 45 [2024-11-28 04:17:38,668 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 04:17:38,954 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 04:17:38,961 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 04:17:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:17:39,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:17:39,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:17:39,720 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 56 treesize of output 60 [2024-11-28 04:17:39,852 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_2 Int) (v_ArrVal_1240 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1240) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_2) |c_ULTIMATE.start_main_~end~0#1.base|) (< v_prenex_2 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_2))) (forall ((v_prenex_2 Int) (v_prenex_3 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_2) (+ |c_ULTIMATE.start_main_~end~0#1.offset| 1)) (< v_prenex_2 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_2))) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_94| Int) (v_ArrVal_1241 (Array Int Int))) (or (< 0 (+ 9 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1241) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_94|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_94| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_94|)))) is different from false [2024-11-28 04:17:40,380 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_94| Int) (v_ArrVal_1241 (Array Int Int))) (or (< 0 (+ 9 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1241) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_94|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_94| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_94|))) (forall ((v_prenex_2 Int) (v_ArrVal_1240 (Array Int Int))) (or (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1240) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_2)) (< v_prenex_2 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_2))) (forall ((v_prenex_2 Int) (v_prenex_3 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_3) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_2) 1) (< v_prenex_2 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_2))))) is different from false [2024-11-28 04:17:41,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:17:41,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 52 [2024-11-28 04:17:41,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:17:41,357 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 166 treesize of output 161 [2024-11-28 04:17:41,374 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 57 treesize of output 55 [2024-11-28 04:17:41,383 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 86 treesize of output 80 [2024-11-28 04:17:41,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:17:41,529 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 53 treesize of output 54 [2024-11-28 04:17:41,534 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:17:41,539 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:17:41,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:17:41,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:17:41,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-28 04:17:41,563 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:17:41,572 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 04:17:41,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 1 [2024-11-28 04:17:42,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:17:42,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301080891] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:17:42,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:17:42,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2024-11-28 04:17:42,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654837823] [2024-11-28 04:17:42,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:17:42,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-28 04:17:42,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:17:42,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-28 04:17:42,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1341, Unknown=27, NotChecked=150, Total=1640 [2024-11-28 04:17:42,084 INFO L87 Difference]: Start difference. First operand 192 states and 208 transitions. Second operand has 41 states, 40 states have (on average 3.175) internal successors, (127), 41 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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 04:17:45,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:17:45,254 INFO L93 Difference]: Finished difference Result 249 states and 271 transitions. [2024-11-28 04:17:45,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 04:17:45,255 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.175) internal successors, (127), 41 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-28 04:17:45,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:17:45,256 INFO L225 Difference]: With dead ends: 249 [2024-11-28 04:17:45,256 INFO L226 Difference]: Without dead ends: 249 [2024-11-28 04:17:45,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=385, Invalid=2788, Unknown=27, NotChecked=222, Total=3422 [2024-11-28 04:17:45,258 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 550 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 1895 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 2395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 419 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:17:45,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1014 Invalid, 2395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1895 Invalid, 0 Unknown, 419 Unchecked, 2.0s Time] [2024-11-28 04:17:45,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-28 04:17:45,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 195. [2024-11-28 04:17:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 172 states have (on average 1.2093023255813953) internal successors, (208), 193 states have internal predecessors, (208), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:17:45,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 211 transitions. [2024-11-28 04:17:45,265 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 211 transitions. Word has length 43 [2024-11-28 04:17:45,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:17:45,265 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 211 transitions. [2024-11-28 04:17:45,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.175) internal successors, (127), 41 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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 04:17:45,265 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 211 transitions. [2024-11-28 04:17:45,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-28 04:17:45,266 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:17:45,266 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, 1, 1, 1, 1] [2024-11-28 04:17:45,280 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 04:17:45,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:17:45,470 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:17:45,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:17:45,472 INFO L85 PathProgramCache]: Analyzing trace with hash -452352566, now seen corresponding path program 1 times [2024-11-28 04:17:45,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:17:45,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931152984] [2024-11-28 04:17:45,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:45,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:17:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:46,682 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 04:17:46,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:17:46,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931152984] [2024-11-28 04:17:46,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931152984] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:17:46,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054562475] [2024-11-28 04:17:46,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:17:46,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:17:46,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:17:46,686 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:17:46,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 04:17:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:17:46,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-28 04:17:46,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:17:46,888 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 04:17:46,908 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 04:17:46,998 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:17:46,998 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 04:17:47,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:17:47,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 04:17:47,071 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 04:17:47,218 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:17:47,218 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 41 treesize of output 38 [2024-11-28 04:17:47,222 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 04:17:47,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-28 04:17:47,278 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 04:17:47,320 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 04:17:47,344 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-28 04:17:47,344 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 16 treesize of output 18 [2024-11-28 04:17:47,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 04:17:47,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 04:17:47,489 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:17:47,489 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 1 case distinctions, treesize of input 49 treesize of output 44 [2024-11-28 04:17:47,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 04:17:47,526 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 24 treesize of output 12 [2024-11-28 04:17:47,551 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 04:17:47,563 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 04:17:47,637 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 04:17:47,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:17:47,730 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1403 (Array Int Int))) (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-28 04:17:51,842 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1400 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1401) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1400) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-28 04:17:52,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:17:52,042 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 33 treesize of output 34 [2024-11-28 04:17:52,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2024-11-28 04:17:52,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-28 04:17:57,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:17:57,825 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 183 treesize of output 152 [2024-11-28 04:17:57,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 287 treesize of output 263 [2024-11-28 04:17:57,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 243 [2024-11-28 04:17:58,262 INFO L349 Elim1Store]: treesize reduction 4, result has 96.9 percent of original size [2024-11-28 04:17:58,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 250 treesize of output 360 [2024-11-28 04:17:58,291 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 260 treesize of output 248 [2024-11-28 04:18:53,690 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse3 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse17 (forall ((v_arrayElimCell_80 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_80) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1399 (Array Int Int))) (let ((.cse49 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)))) (let ((.cse48 (store .cse49 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1399))) (or (= (select (select (store .cse48 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store (store (store .cse49 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1394) v_arrayElimCell_80 v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_1401 (Array Int Int)) (v_arrayElimCell_78 Int)) (= (select (select (store (store .cse48 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_80)))) (.cse5 (forall ((v_arrayElimCell_80 Int)) (or (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1399 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1394 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse47 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)))) (or (= (select (select (store (store .cse47 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store (store .cse47 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1394) v_arrayElimCell_80 v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_80)))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_80)))) (.cse18 (forall ((v_arrayElimCell_80 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1399 (Array Int Int))) (let ((.cse46 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)))) (or (= (select (select (store (store .cse46 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_arrayElimCell_78 Int)) (= (select (select (store (store (store (store .cse46 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1394) v_arrayElimCell_80 v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_80) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_80)))) (.cse26 (forall ((v_arrayElimCell_80 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1399 (Array Int Int))) (let ((.cse45 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)))) (or (= (select (select (store (store .cse45 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_arrayElimCell_78 Int)) (= (select (select (store (store (store (store .cse45 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1394) v_arrayElimCell_80 v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_80))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_80) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_80)))) (.cse9 (forall ((v_arrayElimCell_80 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_80) (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1399 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1394 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse44 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)))) (or (= (select (select (store (store .cse44 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store (store .cse44 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1394) v_arrayElimCell_80 v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_80)))) (.cse10 (forall ((v_arrayElimCell_80 Int)) (or (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1399 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1394 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse43 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)))) (let ((.cse42 (store .cse43 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1399))) (or (= (select (select (store .cse42 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store .cse42 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store .cse43 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1394) v_arrayElimCell_80 v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_80) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_80)))) (.cse11 (not .cse4)) (.cse6 (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1399 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_arrayElimCell_78 Int)) (let ((.cse41 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1399))) (or (= (select (select (store .cse41 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store .cse41 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (.cse8 (forall ((v_prenex_17 Int) (v_prenex_14 Int) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_14)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) v_prenex_17 v_prenex_15) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_17 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17))))) (and (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_arrayElimCell_80 Int) (v_ArrVal_1399 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1394 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)))) (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1399))) (or (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store .cse0 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1394) v_arrayElimCell_80 v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_80))))) (or .cse4 (and .cse5 .cse6)) (or .cse4 (and (forall ((v_prenex_17 Int) (v_prenex_14 Int) (v_prenex_18 (Array Int Int)) (v_arrayElimCell_87 Int) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_14)))) (or (= (select (select (store (store .cse7 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) v_prenex_17 v_prenex_15) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store (store .cse7 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_87 v_prenex_16) v_prenex_17 v_prenex_15) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_17 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_87) (= v_prenex_17 v_arrayElimCell_87) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17)))) .cse8)) (or .cse4 (and .cse9 .cse5 .cse10 .cse6)) (or .cse11 (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1399 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_arrayElimCell_80 Int) (v_ArrVal_1394 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)))) (let ((.cse13 (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1394) v_arrayElimCell_80 v_ArrVal_1399))) (or (= (select (select (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store .cse13 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse13 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_80) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_80)))))) (or .cse4 (and .cse9 .cse10 (forall ((v_arrayElimCell_80 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_80) (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1399 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1394 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)))) (or (= (select (select (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1394) v_arrayElimCell_80 v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_80)))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_80))) .cse6)) (or .cse11 (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1399 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_arrayElimCell_80 Int) (v_ArrVal_1394 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)))) (let ((.cse16 (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1394) v_arrayElimCell_80 v_ArrVal_1399))) (or (= (select (select (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store .cse16 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse16 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_80)))))) (or .cse11 (forall ((v_prenex_17 Int) (v_prenex_14 Int) (v_prenex_18 (Array Int Int)) (v_arrayElimCell_87 Int) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_14)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_87 v_prenex_16) v_prenex_17 v_prenex_15) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_17 v_arrayElimCell_87) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17)))) (or (and .cse17 .cse10 .cse18 .cse6) .cse4) (forall ((v_arrayElimCell_80 Int)) (or (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1399 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1394 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1399))) (or (= (select (select (store .cse19 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store .cse19 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1394) v_arrayElimCell_80 v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_80))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_80))) (or (and (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_arrayElimCell_80 Int) (v_ArrVal_1399 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1394 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)))) (or (= (select (select (store (store (store .cse21 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store .cse21 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1394) v_arrayElimCell_80 v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_80)))) (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_arrayElimCell_80 Int) (v_ArrVal_1399 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1394 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse22 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1394) v_arrayElimCell_80 v_ArrVal_1399))) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store .cse22 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse22 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_80))))) .cse11) (or .cse4 (and .cse9 .cse17 .cse5 .cse10 .cse18 .cse6)) (or .cse11 (and (forall ((v_arrayElimCell_80 Int)) (or (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1399 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1394 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse23 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1394) v_arrayElimCell_80 v_ArrVal_1399))) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store .cse23 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse23 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_80)))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_80))) (forall ((v_arrayElimCell_80 Int)) (or (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1399 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1394 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)))) (or (= (select (select (store (store (store .cse24 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store .cse24 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1394) v_arrayElimCell_80 v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_80)))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_80))))) (or .cse4 (and (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_arrayElimCell_80 Int) (v_ArrVal_1399 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1394 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)))) (or (= (select (select (store (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1394) v_arrayElimCell_80 v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_80)))) .cse6)) (or .cse4 (and .cse17 .cse10 .cse18 .cse6 .cse26)) (or .cse11 (and (forall ((v_arrayElimCell_80 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1399 (Array Int Int)) (v_ArrVal_1394 (Array Int Int))) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)))) (or (= (select (select (store (store (store .cse27 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1394) v_arrayElimCell_80 v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_ArrVal_1401 (Array Int Int)) (v_arrayElimCell_78 Int)) (= (select (select (store (store (store .cse27 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_80))) (forall ((v_arrayElimCell_80 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1399 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse28 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1394) v_arrayElimCell_80 v_ArrVal_1399))) (or (= (select (select (store .cse28 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse28 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_80))))) (or .cse4 .cse8) (or .cse4 (and (forall ((v_arrayElimCell_87 Int)) (or (forall ((v_prenex_17 Int)) (or (= v_prenex_17 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_14 Int) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_14)))) (or (= (select (select (store (store .cse29 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) v_prenex_17 v_prenex_15) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_prenex_18 (Array Int Int))) (= (select (select (store (store (store .cse29 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_87 v_prenex_16) v_prenex_17 v_prenex_15) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))) (= v_prenex_17 v_arrayElimCell_87) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_87))) .cse8)) (or .cse4 (and (forall ((v_arrayElimCell_80 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1399 (Array Int Int))) (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)))) (or (= (select (select (store (store .cse30 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_arrayElimCell_78 Int)) (= (select (select (store (store (store (store .cse30 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1394) v_arrayElimCell_80 v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_80))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_80))) .cse6)) (or .cse4 (and .cse9 .cse17 .cse5 (forall ((v_arrayElimCell_80 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_80) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1399 (Array Int Int))) (let ((.cse32 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)))) (let ((.cse31 (store .cse32 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1399))) (or (= (select (select (store .cse31 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store (store (store .cse32 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1394) v_arrayElimCell_80 v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_1401 (Array Int Int)) (v_arrayElimCell_78 Int)) (= (select (select (store (store .cse31 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_80))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_80))) .cse10 .cse18 .cse6 .cse26)) (or (and .cse9 .cse10 .cse6) .cse4) (or .cse11 (and (forall ((v_arrayElimCell_80 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1399 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse33 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1394) v_arrayElimCell_80 v_ArrVal_1399))) (or (= (select (select (store .cse33 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse33 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_80))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_80))) (forall ((v_arrayElimCell_80 Int)) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_80) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1399 (Array Int Int)) (v_ArrVal_1394 (Array Int Int))) (let ((.cse34 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)))) (or (= (select (select (store (store (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1394) v_arrayElimCell_80 v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_ArrVal_1401 (Array Int Int)) (v_arrayElimCell_78 Int)) (= (select (select (store (store (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_80))))))) (or .cse4 (and (forall ((v_arrayElimCell_80 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1399 (Array Int Int))) (let ((.cse35 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)))) (or (= (select (select (store (store .cse35 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_arrayElimCell_78 Int)) (= (select (select (store (store (store (store .cse35 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1394) v_arrayElimCell_80 v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_80))) .cse6)) (forall ((v_prenex_17 Int) (v_prenex_14 Int) (v_prenex_18 (Array Int Int)) (v_arrayElimCell_87 Int) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse36 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_14)))) (or (= (select (select (store (store .cse36 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) v_prenex_17 v_prenex_15) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store (store .cse36 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_87 v_prenex_16) v_prenex_17 v_prenex_15) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_17 |c_ULTIMATE.start_main_~end~0#1.base|) (= v_prenex_17 v_arrayElimCell_87) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17)))) (or .cse4 (and (forall ((v_arrayElimCell_87 Int)) (or (forall ((v_prenex_17 Int)) (or (= v_prenex_17 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_14 Int) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse37 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_14)))) (or (= (select (select (store (store .cse37 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) v_prenex_17 v_prenex_15) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_prenex_18 (Array Int Int))) (= (select (select (store (store (store .cse37 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_87 v_prenex_16) v_prenex_17 v_prenex_15) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_87) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_87))) .cse8)) (forall ((v_arrayElimCell_80 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_ArrVal_1392 Int) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1399 (Array Int Int))) (let ((.cse39 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1392)))) (let ((.cse38 (store .cse39 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1399))) (or (= (select (select (store .cse38 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store (store (store .cse39 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1394) v_arrayElimCell_80 v_ArrVal_1399) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_1401 (Array Int Int)) (v_arrayElimCell_78 Int)) (= (select (select (store (store .cse38 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1401) v_arrayElimCell_78 v_ArrVal_1403) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_80))) (or .cse4 (and (forall ((v_prenex_17 Int) (v_prenex_14 Int) (v_prenex_18 (Array Int Int)) (v_arrayElimCell_87 Int) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse40 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_14)))) (or (= (select (select (store (store .cse40 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_16) v_prenex_17 v_prenex_15) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store (store .cse40 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_87 v_prenex_16) v_prenex_17 v_prenex_15) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_17 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_87) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_87)))) .cse8))))) is different from false [2024-11-28 04:21:06,119 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:21:06,125 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-28 04:21:06,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 1 [2024-11-28 04:21:06,134 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:21:06,135 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:21:06,144 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 04:21:06,153 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 04:21:06,167 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:21:06,172 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-28 04:21:06,173 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 2 case distinctions, treesize of input 63 treesize of output 1 [2024-11-28 04:21:06,184 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:21:06,192 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-28 04:21:06,192 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 2 case distinctions, treesize of input 63 treesize of output 1 [2024-11-28 04:21:06,204 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:21:06,209 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-28 04:21:06,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 1 [2024-11-28 04:21:06,222 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:21:06,228 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-28 04:21:06,229 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 2 case distinctions, treesize of input 63 treesize of output 1 [2024-11-28 04:21:06,240 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:21:06,249 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-28 04:21:06,249 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 2 case distinctions, treesize of input 63 treesize of output 1 [2024-11-28 04:21:06,261 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:21:06,268 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-28 04:21:06,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 1 [2024-11-28 04:21:06,281 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:21:06,288 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-28 04:21:06,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 1 [2024-11-28 04:21:06,302 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:21:06,309 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-28 04:21:06,310 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 2 case distinctions, treesize of input 63 treesize of output 1 [2024-11-28 04:21:06,324 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:21:06,332 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-28 04:21:06,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 1 [2024-11-28 04:21:06,345 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:21:06,353 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-28 04:21:06,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 1 [2024-11-28 04:21:06,368 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:21:06,375 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-28 04:21:06,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 1 [2024-11-28 04:21:06,389 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:21:06,396 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-28 04:21:06,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 1 [2024-11-28 04:21:06,409 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:21:06,416 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-28 04:21:06,416 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 2 case distinctions, treesize of input 63 treesize of output 1 [2024-11-28 04:21:06,432 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:21:06,440 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-28 04:21:06,440 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 2 case distinctions, treesize of input 63 treesize of output 1 [2024-11-28 04:21:06,454 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:21:06,462 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-28 04:21:06,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 1 [2024-11-28 04:21:06,475 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:21:06,482 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-28 04:21:06,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 1 [2024-11-28 04:21:17,644 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 04:21:17,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054562475] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:21:17,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:21:17,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 21] total 45 [2024-11-28 04:21:17,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338138774] [2024-11-28 04:21:17,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:21:17,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-28 04:21:17,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:17,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-28 04:21:17,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=1420, Unknown=53, NotChecked=246, Total=1980 [2024-11-28 04:21:17,647 INFO L87 Difference]: Start difference. First operand 195 states and 211 transitions. Second operand has 45 states, 45 states have (on average 2.422222222222222) internal successors, (109), 45 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:21,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:21:24,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:21:25,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:21:27,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:21:30,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:21:34,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:21:37,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:21:41,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:21:48,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:21:52,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:21:54,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:21:57,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:22:01,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:22:03,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:22:06,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:22:10,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:22:16,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:22:17,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:22:20,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:22:27,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:22:33,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:22:35,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:22:38,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:22:43,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:22:46,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:22:50,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:22:54,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:22:58,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:23:00,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:23:02,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:23:05,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:23:08,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:23:10,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:23:14,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:23:16,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:23:22,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:23:24,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:23:27,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:23:31,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:23:34,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:23:38,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:23:42,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:23:45,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:23:48,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:23:53,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:23:56,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:24:00,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:24:04,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:24:06,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:24:10,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:24:12,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:24:16,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:24:20,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:24:22,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:24:25,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:24:27,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:24:29,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:24:31,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:24:35,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:24:38,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:24:40,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:24:42,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:24:44,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:24:48,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:24:50,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:24:52,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:24:54,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:24:55,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:24:59,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:01,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:04,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:08,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:10,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:12,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:16,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:18,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:19,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:22,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:23,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:24,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:26,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:28,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:32,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:34,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:38,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:40,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:41,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:43,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:46,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:50,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:51,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:53,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:55,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:25:59,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:01,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:03,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:05,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:07,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:10,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:12,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:15,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:16,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:19,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:21,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:24,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:25,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:28,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:30,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:32,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:35,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:36,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:37,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:39,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:41,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:45,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:46,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:49,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:51,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:54,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:55,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:26:57,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:27:01,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:27:04,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:27:06,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:27:06,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:27:06,622 INFO L93 Difference]: Finished difference Result 273 states and 297 transitions. [2024-11-28 04:27:06,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 04:27:06,644 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.422222222222222) internal successors, (109), 45 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-28 04:27:06,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:27:06,645 INFO L225 Difference]: With dead ends: 273 [2024-11-28 04:27:06,645 INFO L226 Difference]: Without dead ends: 273 [2024-11-28 04:27:06,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 168.7s TimeCoverageRelationStatistics Valid=457, Invalid=2256, Unknown=55, NotChecked=312, Total=3080 [2024-11-28 04:27:06,647 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 572 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 75 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 321.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 2177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 587 IncrementalHoareTripleChecker+Unchecked, 324.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:27:06,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 897 Invalid, 2177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1494 Invalid, 21 Unknown, 587 Unchecked, 324.3s Time] [2024-11-28 04:27:06,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-28 04:27:06,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 216. [2024-11-28 04:27:06,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 193 states have (on average 1.1917098445595855) internal successors, (230), 214 states have internal predecessors, (230), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:27:06,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 233 transitions. [2024-11-28 04:27:06,655 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 233 transitions. Word has length 48 [2024-11-28 04:27:06,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:27:06,656 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 233 transitions. [2024-11-28 04:27:06,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.422222222222222) internal successors, (109), 45 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:27:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 233 transitions. [2024-11-28 04:27:06,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-28 04:27:06,657 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:27:06,657 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:27:06,672 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 04:27:06,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:27:06,862 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:27:06,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:27:06,863 INFO L85 PathProgramCache]: Analyzing trace with hash 232874677, now seen corresponding path program 2 times [2024-11-28 04:27:06,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:27:06,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807536399] [2024-11-28 04:27:06,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:27:06,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:27:06,897 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:27:06,897 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:27:08,966 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:27:08,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:27:08,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807536399] [2024-11-28 04:27:08,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807536399] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:27:08,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085075146] [2024-11-28 04:27:08,966 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:27:08,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:27:08,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:27:08,968 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:27:08,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 04:27:09,134 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:27:09,134 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:27:09,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-28 04:27:09,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:27:09,146 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 04:27:09,261 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:27:09,262 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 04:27:09,295 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 04:27:09,305 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 04:27:09,457 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:27:09,457 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 41 treesize of output 38 [2024-11-28 04:27:09,464 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 04:27:09,776 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 04:27:09,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-28 04:27:09,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:27:09,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 04:27:09,999 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 04:27:09,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-11-28 04:27:10,038 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 04:27:10,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-28 04:27:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:27:11,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:27:18,842 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1504 (Array Int Int)) (v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1500 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_109| Int) (|v_ULTIMATE.start_main_~end~0#1.offset_111| Int) (|v_ULTIMATE.start_main_~end~0#1.offset_110| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1501))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1500))) (or (not (= v_ArrVal_1505 (let ((.cse2 (+ |v_ULTIMATE.start_main_~end~0#1.offset_111| 8))) (store (store (select .cse0 .cse1) |v_ULTIMATE.start_main_~end~0#1.offset_111| 0) .cse2 (select v_ArrVal_1505 .cse2))))) (not (= (select v_ArrVal_1504 |v_ULTIMATE.start_main_~end~0#1.offset_111|) 0)) (= (select (let ((.cse3 (store .cse4 .cse1 v_ArrVal_1504))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_110|))) |v_ULTIMATE.start_main_~end~0#1.offset_109|) 0) (< (select (select (store .cse0 .cse1 v_ArrVal_1505) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_110|) |v_ULTIMATE.start_main_~end~0#1.offset_109|) (< |v_ULTIMATE.start_main_~end~0#1.offset_109| 0) (< (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) |v_ULTIMATE.start_main_~end~0#1.offset_111|) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_110|) (< |v_ULTIMATE.start_main_~end~0#1.offset_110| 0) (< |v_ULTIMATE.start_main_~end~0#1.offset_111| 0))))) (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1504 (Array Int Int)) (v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1500 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_109| Int) (|v_ULTIMATE.start_main_~end~0#1.offset_111| Int) (|v_ULTIMATE.start_main_~end~0#1.offset_110| Int)) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1501))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1500)) (.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse8 (store .cse5 .cse6 v_ArrVal_1505))) (or (not (= v_ArrVal_1505 (let ((.cse7 (+ |v_ULTIMATE.start_main_~end~0#1.offset_111| 8))) (store (store (select .cse5 .cse6) |v_ULTIMATE.start_main_~end~0#1.offset_111| 0) .cse7 (select v_ArrVal_1505 .cse7))))) (not (= (select v_ArrVal_1504 |v_ULTIMATE.start_main_~end~0#1.offset_111|) 0)) (< (select (select .cse8 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_110|) |v_ULTIMATE.start_main_~end~0#1.offset_109|) (< |v_ULTIMATE.start_main_~end~0#1.offset_109| 0) (< (select (select .cse5 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) |v_ULTIMATE.start_main_~end~0#1.offset_111|) (= (select (select .cse8 (select (select (store .cse9 .cse6 v_ArrVal_1504) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_110|)) |v_ULTIMATE.start_main_~end~0#1.offset_109|) 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_110|) (< |v_ULTIMATE.start_main_~end~0#1.offset_110| 0) (< |v_ULTIMATE.start_main_~end~0#1.offset_111| 0))))))) is different from false [2024-11-28 04:27:19,036 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1504 (Array Int Int)) (v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1500 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_109| Int) (|v_ULTIMATE.start_main_~end~0#1.offset_111| Int) (|v_ULTIMATE.start_main_~end~0#1.offset_110| Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_1501))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_1500)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= (select v_ArrVal_1504 |v_ULTIMATE.start_main_~end~0#1.offset_111|) 0)) (< |v_ULTIMATE.start_main_~end~0#1.offset_109| 0) (= (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1504))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_110|))) |v_ULTIMATE.start_main_~end~0#1.offset_109|) 0) (< (select (select (store .cse3 .cse2 v_ArrVal_1505) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_110|) |v_ULTIMATE.start_main_~end~0#1.offset_109|) (< (select (select .cse3 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) |v_ULTIMATE.start_main_~end~0#1.offset_111|) (not (= (let ((.cse4 (+ |v_ULTIMATE.start_main_~end~0#1.offset_111| 8))) (store (store (select .cse3 .cse2) |v_ULTIMATE.start_main_~end~0#1.offset_111| 0) .cse4 (select v_ArrVal_1505 .cse4))) v_ArrVal_1505)) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_110|) (< |v_ULTIMATE.start_main_~end~0#1.offset_110| 0) (< |v_ULTIMATE.start_main_~end~0#1.offset_111| 0))))) (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1504 (Array Int Int)) (v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1500 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_109| Int) (|v_ULTIMATE.start_main_~end~0#1.offset_111| Int) (|v_ULTIMATE.start_main_~end~0#1.offset_110| Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_1501))) (let ((.cse9 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_1500)) (.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse6 (store .cse9 .cse8 v_ArrVal_1505))) (or (not (= (select v_ArrVal_1504 |v_ULTIMATE.start_main_~end~0#1.offset_111|) 0)) (< |v_ULTIMATE.start_main_~end~0#1.offset_109| 0) (= (select (select .cse6 (select (select (store .cse7 .cse8 v_ArrVal_1504) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_110|)) |v_ULTIMATE.start_main_~end~0#1.offset_109|) 0) (< (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_110|) |v_ULTIMATE.start_main_~end~0#1.offset_109|) (< (select (select .cse9 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) |v_ULTIMATE.start_main_~end~0#1.offset_111|) (not (= (let ((.cse10 (+ |v_ULTIMATE.start_main_~end~0#1.offset_111| 8))) (store (store (select .cse9 .cse8) |v_ULTIMATE.start_main_~end~0#1.offset_111| 0) .cse10 (select v_ArrVal_1505 .cse10))) v_ArrVal_1505)) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_110|) (< |v_ULTIMATE.start_main_~end~0#1.offset_110| 0) (< |v_ULTIMATE.start_main_~end~0#1.offset_111| 0)))))))) is different from false [2024-11-28 04:27:19,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:27:19,252 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 168 treesize of output 144 [2024-11-28 04:27:19,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:27:19,269 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 126 treesize of output 94 [2024-11-28 04:27:19,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:27:19,316 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 589 treesize of output 516 [2024-11-28 04:27:19,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:27:19,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 818 treesize of output 928 [2024-11-28 04:27:19,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:27:19,742 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 533 treesize of output 473 [2024-11-28 04:27:20,176 INFO L349 Elim1Store]: treesize reduction 96, result has 49.5 percent of original size [2024-11-28 04:27:20,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 400 treesize of output 457 [2024-11-28 04:27:20,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:27:20,250 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 366 treesize of output 334 [2024-11-28 04:27:21,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:27:21,680 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 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-28 04:27:29,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:27:31,472 INFO L349 Elim1Store]: treesize reduction 44, result has 35.3 percent of original size [2024-11-28 04:27:31,472 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 134 [2024-11-28 04:27:37,042 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 15 [2024-11-28 04:27:37,422 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 15 [2024-11-28 04:27:37,817 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 15 [2024-11-28 04:27:38,813 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 15 [2024-11-28 04:27:39,873 INFO L349 Elim1Store]: treesize reduction 32, result has 52.9 percent of original size [2024-11-28 04:27:39,873 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 82 [2024-11-28 04:27:39,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:27:39,972 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 36 treesize of output 46 [2024-11-28 04:27:40,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:27:40,243 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 36 treesize of output 46 [2024-11-28 04:27:40,448 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 15 [2024-11-28 04:27:42,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 19 treesize of output 15 [2024-11-28 04:27:42,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 04:27:42,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-28 04:27:43,458 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 15 [2024-11-28 04:28:00,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 5 treesize of output 3 [2024-11-28 04:28:00,932 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 65 treesize of output 61 [2024-11-28 04:28:01,509 INFO L349 Elim1Store]: treesize reduction 32, result has 52.9 percent of original size [2024-11-28 04:28:01,510 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 187 [2024-11-28 04:28:01,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:28:01,845 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 36 treesize of output 46 [2024-11-28 04:28:02,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:28:02,007 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 36 treesize of output 46 [2024-11-28 04:28:02,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:28:05,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:28:05,181 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 74 treesize of output 76 [2024-11-28 04:28:06,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:28:06,421 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 74 treesize of output 76 [2024-11-28 04:28:07,522 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 104 [2024-11-28 04:28:08,278 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 65 treesize of output 61 [2024-11-28 04:28:08,617 INFO L349 Elim1Store]: treesize reduction 67, result has 1.5 percent of original size [2024-11-28 04:28:08,617 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 1 [2024-11-28 04:28:09,302 INFO L349 Elim1Store]: treesize reduction 32, result has 42.9 percent of original size [2024-11-28 04:28:09,303 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 2 case distinctions, treesize of input 31 treesize of output 36 [2024-11-28 04:28:09,673 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 110 treesize of output 106 [2024-11-28 04:28:09,979 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 85 treesize of output 81 [2024-11-28 04:28:10,281 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 04:28:10,413 INFO L349 Elim1Store]: treesize reduction 67, result has 1.5 percent of original size [2024-11-28 04:28:10,414 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 1 [2024-11-28 04:28:10,488 INFO L349 Elim1Store]: treesize reduction 67, result has 1.5 percent of original size [2024-11-28 04:28:10,488 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 1 [2024-11-28 04:28:10,623 INFO L349 Elim1Store]: treesize reduction 67, result has 1.5 percent of original size [2024-11-28 04:28:10,623 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 1 [2024-11-28 04:28:10,803 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 100 [2024-11-28 04:28:11,966 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 04:28:11,966 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 37 treesize of output 1 [2024-11-28 04:28:12,204 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 04:28:12,204 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 37 treesize of output 1 [2024-11-28 04:28:24,593 INFO L349 Elim1Store]: treesize reduction 32, result has 52.9 percent of original size [2024-11-28 04:28:24,593 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 72 [2024-11-28 04:28:24,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:28:24,859 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 59 treesize of output 69 [2024-11-28 04:28:25,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 04:28:25,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 04:28:25,258 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 04:28:25,600 INFO L349 Elim1Store]: treesize reduction 64, result has 48.8 percent of original size [2024-11-28 04:28:25,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 117 treesize of output 155 [2024-11-28 04:28:26,007 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2024-11-28 04:28:26,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 79 [2024-11-28 04:28:26,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:28:27,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2024-11-28 04:28:27,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:28:27,346 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 69 treesize of output 69 [2024-11-28 04:28:27,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:28:27,759 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 04:28:27,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:28:27,879 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 124 treesize of output 120 [2024-11-28 04:28:28,492 INFO L349 Elim1Store]: treesize reduction 124, result has 0.8 percent of original size [2024-11-28 04:28:28,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 1 [2024-11-28 04:28:28,513 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 04:28:28,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:28:28,934 INFO L349 Elim1Store]: treesize reduction 64, result has 48.8 percent of original size [2024-11-28 04:28:28,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 134 treesize of output 178 [2024-11-28 04:28:29,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:28:29,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 100 treesize of output 134 [2024-11-28 04:28:30,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:28:30,589 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 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-28 04:28:30,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:28:30,925 INFO L349 Elim1Store]: treesize reduction 67, result has 1.5 percent of original size [2024-11-28 04:28:30,925 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 1 [2024-11-28 04:28:30,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 8 [2024-11-28 04:28:31,313 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:28:31,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-11-28 04:28:31,528 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:28:31,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-11-28 04:28:31,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:28:31,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:28:31,677 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 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-28 04:28:54,430 INFO L349 Elim1Store]: treesize reduction 64, result has 48.8 percent of original size [2024-11-28 04:28:54,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 2559 treesize of output 2471 [2024-11-28 04:29:00,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:29:00,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 79 [2024-11-28 04:29:00,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:29:00,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:29:00,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 61 [2024-11-28 04:29:01,471 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2024-11-28 04:29:01,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 79 [2024-11-28 04:29:01,666 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:29:01,667 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:29:01,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:29:01,671 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2024-11-28 04:29:01,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:29:01,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 79 [2024-11-28 04:29:02,211 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2024-11-28 04:29:02,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 79 [2024-11-28 04:29:02,726 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2024-11-28 04:29:02,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 79 [2024-11-28 04:29:02,881 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 04:29:03,013 INFO L349 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2024-11-28 04:29:03,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 67 [2024-11-28 04:29:03,291 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:29:03,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:29:03,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:29:03,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 49 [2024-11-28 04:29:03,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:29:03,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 97 [2024-11-28 04:29:03,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:29:03,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 79 [2024-11-28 04:29:04,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:29:04,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 79 [2024-11-28 04:29:07,161 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-28 04:29:07,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:29:07,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 158 treesize of output 180 [2024-11-28 04:29:09,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2024-11-28 04:29:09,947 INFO L349 Elim1Store]: treesize reduction 43, result has 45.6 percent of original size [2024-11-28 04:29:09,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 301 treesize of output 298 [2024-11-28 04:29:10,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:29:10,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 729 treesize of output 709 [2024-11-28 04:29:20,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:29:20,059 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 99 treesize of output 83 [2024-11-28 04:29:20,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:29:20,082 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 134 treesize of output 94 [2024-11-28 04:29:20,090 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:29:20,387 INFO L349 Elim1Store]: treesize reduction 60, result has 49.2 percent of original size [2024-11-28 04:29:20,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 1338 treesize of output 927 [2024-11-28 04:29:20,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:29:20,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:29:20,484 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 175 [2024-11-28 04:29:20,503 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:29:20,509 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 37 treesize of output 25 [2024-11-28 04:29:20,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:29:20,543 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2024-11-28 04:29:20,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:29:21,766 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:29:21,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085075146] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:29:21,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:29:21,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 19] total 44 [2024-11-28 04:29:21,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233385958] [2024-11-28 04:29:21,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:29:21,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-28 04:29:21,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:29:21,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-28 04:29:21,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1519, Unknown=59, NotChecked=162, Total=1892 [2024-11-28 04:29:21,770 INFO L87 Difference]: Start difference. First operand 216 states and 233 transitions. Second operand has 44 states, 44 states have (on average 2.840909090909091) internal successors, (125), 44 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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 04:29:32,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:29:32,516 INFO L93 Difference]: Finished difference Result 260 states and 283 transitions. [2024-11-28 04:29:32,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 04:29:32,517 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.840909090909091) internal successors, (125), 44 states have internal predecessors, (125), 0 states have call successors, (0), 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 48 [2024-11-28 04:29:32,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:29:32,518 INFO L225 Difference]: With dead ends: 260 [2024-11-28 04:29:32,518 INFO L226 Difference]: Without dead ends: 260 [2024-11-28 04:29:32,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=389, Invalid=2963, Unknown=78, NotChecked=230, Total=3660 [2024-11-28 04:29:32,520 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 438 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 2101 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 2556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 413 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:29:32,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1355 Invalid, 2556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2101 Invalid, 0 Unknown, 413 Unchecked, 6.0s Time] [2024-11-28 04:29:32,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-28 04:29:32,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 218. [2024-11-28 04:29:32,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 195 states have (on average 1.1897435897435897) internal successors, (232), 216 states have internal predecessors, (232), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:29:32,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 235 transitions. [2024-11-28 04:29:32,527 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 235 transitions. Word has length 48 [2024-11-28 04:29:32,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:29:32,527 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 235 transitions. [2024-11-28 04:29:32,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.840909090909091) internal successors, (125), 44 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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 04:29:32,527 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 235 transitions. [2024-11-28 04:29:32,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-28 04:29:32,528 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:29:32,528 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:29:32,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 04:29:32,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:29:32,733 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 04:29:32,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:29:32,734 INFO L85 PathProgramCache]: Analyzing trace with hash -643632207, now seen corresponding path program 1 times [2024-11-28 04:29:32,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:29:32,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337172757] [2024-11-28 04:29:32,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:29:32,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:29:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:29:34,639 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 04:29:34,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:29:34,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337172757] [2024-11-28 04:29:34,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337172757] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:29:34,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860614371] [2024-11-28 04:29:34,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:29:34,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:29:34,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:29:34,642 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:29:34,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1697454-4c48-41ed-ba0e-682a825564f3/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 04:29:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:29:34,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-28 04:29:34,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:29:34,826 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 04:29:34,958 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:29:34,959 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 04:29:34,993 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 04:29:35,005 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 04:29:35,262 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:29:35,262 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 41 treesize of output 38 [2024-11-28 04:29:35,274 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 04:29:35,495 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 04:29:35,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 04:29:35,762 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:29:35,762 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 82 treesize of output 71 [2024-11-28 04:29:35,769 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 11 [2024-11-28 04:29:35,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2024-11-28 04:29:36,572 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 38 treesize of output 22 [2024-11-28 04:29:36,581 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 15 treesize of output 7 [2024-11-28 04:29:36,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:29:36,819 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 17 treesize of output 15 [2024-11-28 04:29:37,022 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 04:29:37,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:29:39,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:29:39,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 100 [2024-11-28 04:29:40,519 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (< |c_ULTIMATE.start_main_~end~0#1.offset| 2)) (.cse8 (= |c_ULTIMATE.start_main_~end~0#1.offset| 0)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8)) (.cse3 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 1))) (and (forall ((v_ArrVal_1608 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1608 .cse1)) v_ArrVal_1608)) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_119| Int)) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_119|) 0) (forall ((v_ArrVal_1606 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_119|) |c_ULTIMATE.start_main_~end~0#1.base|)) (< |v_ULTIMATE.start_main_~end~0#1.offset_119| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_119|))))) (forall ((v_ArrVal_1608 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1608 .cse1)) v_ArrVal_1608)) (forall ((v_prenex_86 Int)) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86))) (or (< .cse2 .cse3) (< v_prenex_86 0) (< .cse2 1) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_86) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_119| Int) (v_ArrVal_1606 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|))) (= (select .cse4 |v_ULTIMATE.start_main_~end~0#1.offset_119|) (select .cse4 v_prenex_86))))))))) (forall ((v_ArrVal_1608 (Array Int Int))) (or (forall ((v_prenex_86 Int)) (or (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_119| Int) (v_ArrVal_1606 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse6 (select .cse5 v_prenex_86))) (or (= (select .cse5 |v_ULTIMATE.start_main_~end~0#1.offset_119|) .cse6) (= |c_ULTIMATE.start_main_~end~0#1.base| .cse6))))) (< v_prenex_86 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86) 1) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_86))) (not (= (store .cse0 .cse1 (select v_ArrVal_1608 .cse1)) v_ArrVal_1608)))) (forall ((v_ArrVal_1608 (Array Int Int))) (or (forall ((v_prenex_86 Int) (v_ArrVal_1606 (Array Int Int))) (or (< v_prenex_86 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86) 1) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_86) (= |c_ULTIMATE.start_main_~end~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86)))) (not (= (store .cse0 .cse1 (select v_ArrVal_1608 .cse1)) v_ArrVal_1608)))) (or (forall ((v_prenex_86 Int) (v_ArrVal_1608 (Array Int Int))) (or (< v_prenex_86 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86) 1) (not (= (store .cse0 .cse1 (select v_ArrVal_1608 .cse1)) v_ArrVal_1608)) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_86))) .cse7) (or .cse8 (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_119| Int) (v_prenex_86 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1606 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_119|) 0) (not (= (store .cse0 .cse1 (select v_ArrVal_1608 .cse1)) v_ArrVal_1608)) (let ((.cse9 (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|))) (= (select .cse9 |v_ULTIMATE.start_main_~end~0#1.offset_119|) (select .cse9 v_prenex_86))) (< |v_ULTIMATE.start_main_~end~0#1.offset_119| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_119|)))) (or (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_119| Int) (v_prenex_86 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1606 (Array Int Int))) (or (< v_prenex_86 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86) 1) (not (= (store .cse0 .cse1 (select v_ArrVal_1608 .cse1)) v_ArrVal_1608)) (let ((.cse10 (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|))) (= (select .cse10 |v_ULTIMATE.start_main_~end~0#1.offset_119|) (select .cse10 v_prenex_86))) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_86))) .cse7) (or .cse8 (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_119| Int) (v_ArrVal_1608 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_119|) 0) (not (= (store .cse0 .cse1 (select v_ArrVal_1608 .cse1)) v_ArrVal_1608)) (< |v_ULTIMATE.start_main_~end~0#1.offset_119| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_119|)))) (forall ((v_ArrVal_1608 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_119| Int)) (or (forall ((v_prenex_86 Int) (v_ArrVal_1606 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse11 (select .cse12 |v_ULTIMATE.start_main_~end~0#1.offset_119|))) (or (= .cse11 (select .cse12 v_prenex_86)) (= .cse11 |c_ULTIMATE.start_main_~end~0#1.base|))))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_119|) 0) (< |v_ULTIMATE.start_main_~end~0#1.offset_119| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_119|))) (not (= (store .cse0 .cse1 (select v_ArrVal_1608 .cse1)) v_ArrVal_1608)))) (forall ((v_ArrVal_1608 (Array Int Int))) (or (forall ((v_prenex_86 Int)) (or (< v_prenex_86 0) (forall ((v_ArrVal_1606 (Array Int Int))) (= |c_ULTIMATE.start_main_~end~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86) 1) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_86))) (not (= (store .cse0 .cse1 (select v_ArrVal_1608 .cse1)) v_ArrVal_1608)))) (forall ((v_ArrVal_1608 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_119| Int) (v_ArrVal_1606 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_119|) 0) (< |v_ULTIMATE.start_main_~end~0#1.offset_119| 0) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_119|) |c_ULTIMATE.start_main_~end~0#1.base|) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_119|))) (not (= (store .cse0 .cse1 (select v_ArrVal_1608 .cse1)) v_ArrVal_1608)))) (forall ((v_ArrVal_1608 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1608 .cse1)) v_ArrVal_1608)) (forall ((v_prenex_86 Int)) (let ((.cse13 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86))) (or (< .cse13 .cse3) (< v_prenex_86 0) (< .cse13 1) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_86)))))))) is different from false [2024-11-28 04:29:48,905 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1603 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1603))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1608 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1602))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_prenex_86 Int) (v_ArrVal_1606 (Array Int Int))) (or (< v_prenex_86 0) (= (select (select (store .cse0 .cse1 v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86) .cse1) (< (select (select (store .cse2 .cse1 v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86) 1) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_86))) (not (= v_ArrVal_1608 (let ((.cse4 (+ 8 .cse3))) (store (store (select .cse2 .cse1) .cse3 0) .cse4 (select v_ArrVal_1608 .cse4))))))))) (< .cse3 0))))) (forall ((v_ArrVal_1603 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1603))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (< .cse5 0) (forall ((v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1608 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1602))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_prenex_86 Int)) (or (< (select (select (store .cse6 .cse7 v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86) (+ .cse5 1)) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_119| Int) (v_ArrVal_1606 (Array Int Int))) (let ((.cse8 (select (store .cse9 .cse7 v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|))) (= (select .cse8 |v_ULTIMATE.start_main_~end~0#1.offset_119|) (select .cse8 v_prenex_86)))) (< v_prenex_86 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_86))) (not (= v_ArrVal_1608 (let ((.cse10 (+ 8 .cse5))) (store (store (select .cse6 .cse7) .cse5 0) .cse10 (select v_ArrVal_1608 .cse10))))))))))))) (forall ((v_ArrVal_1603 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1603))) (let ((.cse11 (select (select .cse15 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (= .cse11 0) (forall ((v_ArrVal_1602 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_119| Int) (v_prenex_86 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1606 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1602))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (let ((.cse12 (select (store .cse13 .cse14 v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|))) (= (select .cse12 |v_ULTIMATE.start_main_~end~0#1.offset_119|) (select .cse12 v_prenex_86))) (< (select (select (store .cse15 .cse14 v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_119|) 0) (< |v_ULTIMATE.start_main_~end~0#1.offset_119| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_119|) (not (= v_ArrVal_1608 (let ((.cse16 (+ 8 .cse11))) (store (store (select .cse15 .cse14) .cse11 0) .cse16 (select v_ArrVal_1608 .cse16))))))))) (< .cse11 0))))) (forall ((v_ArrVal_1603 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1603))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (< .cse17 0) (forall ((v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1608 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1602))) (let ((.cse19 (select (select .cse23 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= v_ArrVal_1608 (let ((.cse20 (+ 8 .cse17))) (store (store (select .cse18 .cse19) .cse17 0) .cse20 (select v_ArrVal_1608 .cse20))))) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_119| Int)) (or (< (select (select (store .cse18 .cse19 v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_119|) 0) (< |v_ULTIMATE.start_main_~end~0#1.offset_119| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_119|) (forall ((v_prenex_86 Int) (v_ArrVal_1606 (Array Int Int))) (let ((.cse22 (select (store .cse23 .cse19 v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse21 (select .cse22 |v_ULTIMATE.start_main_~end~0#1.offset_119|))) (or (= .cse21 (select .cse22 v_prenex_86)) (= .cse21 .cse19))))))))))))))) (forall ((v_ArrVal_1603 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1603))) (let ((.cse26 (select (select .cse24 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1608 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1602))) (let ((.cse25 (select (select .cse28 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= v_ArrVal_1608 (let ((.cse27 (+ 8 .cse26))) (store (store (select .cse24 .cse25) .cse26 0) .cse27 (select v_ArrVal_1608 .cse27))))) (forall ((v_prenex_86 Int)) (or (< v_prenex_86 0) (forall ((v_ArrVal_1606 (Array Int Int))) (= (select (select (store .cse28 .cse25 v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86) .cse25)) (< (select (select (store .cse24 .cse25 v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86) 1) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_86))))))) (< .cse26 0))))) (forall ((v_ArrVal_1603 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1603))) (let ((.cse34 (select (select .cse33 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1608 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1602))) (let ((.cse31 (select (select .cse32 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_prenex_86 Int)) (or (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_119| Int) (v_ArrVal_1606 (Array Int Int))) (let ((.cse29 (select (store .cse32 .cse31 v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse30 (select .cse29 v_prenex_86))) (or (= (select .cse29 |v_ULTIMATE.start_main_~end~0#1.offset_119|) .cse30) (= .cse30 .cse31))))) (< v_prenex_86 0) (< (select (select (store .cse33 .cse31 v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86) 1) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_86))) (not (= v_ArrVal_1608 (let ((.cse35 (+ 8 .cse34))) (store (store (select .cse33 .cse31) .cse34 0) .cse35 (select v_ArrVal_1608 .cse35))))))))) (< .cse34 0))))) (forall ((v_ArrVal_1603 (Array Int Int))) (let ((.cse38 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1603))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1608 (Array Int Int))) (let ((.cse36 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1602))) (let ((.cse37 (select (select .cse36 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_119| Int)) (or (forall ((v_ArrVal_1606 (Array Int Int))) (= (select (select (store .cse36 .cse37 v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_119|) .cse37)) (< (select (select (store .cse38 .cse37 v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_119|) 0) (< |v_ULTIMATE.start_main_~end~0#1.offset_119| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_119|))) (not (= v_ArrVal_1608 (let ((.cse40 (+ 8 .cse39))) (store (store (select .cse38 .cse37) .cse39 0) .cse40 (select v_ArrVal_1608 .cse40))))))))) (< .cse39 0))))) (forall ((v_ArrVal_1603 (Array Int Int))) (let ((.cse42 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1603))) (let ((.cse41 (select (select .cse42 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (< .cse41 0) (forall ((v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1608 (Array Int Int))) (let ((.cse43 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1602) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_prenex_86 Int)) (or (< (select (select (store .cse42 .cse43 v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86) (+ .cse41 1)) (< v_prenex_86 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_86))) (not (= v_ArrVal_1608 (let ((.cse44 (+ 8 .cse41))) (store (store (select .cse42 .cse43) .cse41 0) .cse44 (select v_ArrVal_1608 .cse44)))))))))))) (forall ((v_ArrVal_1603 (Array Int Int))) (let ((.cse46 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1603))) (let ((.cse45 (select (select .cse46 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (< .cse45 2) (forall ((v_ArrVal_1602 (Array Int Int)) (v_prenex_86 Int) (v_ArrVal_1608 (Array Int Int))) (let ((.cse47 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1602) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (< v_prenex_86 0) (< (select (select (store .cse46 .cse47 v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86) 1) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_86) (not (= v_ArrVal_1608 (let ((.cse48 (+ 8 .cse45))) (store (store (select .cse46 .cse47) .cse45 0) .cse48 (select v_ArrVal_1608 .cse48)))))))))))) (forall ((v_ArrVal_1603 (Array Int Int))) (let ((.cse52 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1603))) (let ((.cse53 (select (select .cse52 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1602 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_119| Int) (v_prenex_86 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1606 (Array Int Int))) (let ((.cse50 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1602))) (let ((.cse51 (select (select .cse50 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (< v_prenex_86 0) (let ((.cse49 (select (store .cse50 .cse51 v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|))) (= (select .cse49 |v_ULTIMATE.start_main_~end~0#1.offset_119|) (select .cse49 v_prenex_86))) (< (select (select (store .cse52 .cse51 v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86) 1) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_86) (not (= v_ArrVal_1608 (let ((.cse54 (+ 8 .cse53))) (store (store (select .cse52 .cse51) .cse53 0) .cse54 (select v_ArrVal_1608 .cse54))))))))) (< .cse53 2))))) (forall ((v_ArrVal_1603 (Array Int Int))) (let ((.cse57 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1603))) (let ((.cse58 (select (select .cse57 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1608 (Array Int Int))) (let ((.cse55 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1602))) (let ((.cse56 (select (select .cse55 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_119| Int) (v_ArrVal_1606 (Array Int Int))) (or (= (select (select (store .cse55 .cse56 v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_119|) .cse56) (< (select (select (store .cse57 .cse56 v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_119|) 0) (< |v_ULTIMATE.start_main_~end~0#1.offset_119| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_119|))) (not (= v_ArrVal_1608 (let ((.cse59 (+ 8 .cse58))) (store (store (select .cse57 .cse56) .cse58 0) .cse59 (select v_ArrVal_1608 .cse59))))))))) (< .cse58 0))))) (forall ((v_ArrVal_1603 (Array Int Int))) (let ((.cse61 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1603))) (let ((.cse60 (select (select .cse61 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (= .cse60 0) (< .cse60 0) (forall ((v_ArrVal_1602 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_119| Int) (v_ArrVal_1608 (Array Int Int))) (let ((.cse62 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1602) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (< (select (select (store .cse61 .cse62 v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_119|) 0) (< |v_ULTIMATE.start_main_~end~0#1.offset_119| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_119|) (not (= v_ArrVal_1608 (let ((.cse63 (+ 8 .cse60))) (store (store (select .cse61 .cse62) .cse60 0) .cse63 (select v_ArrVal_1608 .cse63))))))))))))) is different from false [2024-11-28 04:29:49,668 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_1603 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_1603))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1608 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_1602))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_prenex_86 Int)) (or (forall ((v_ArrVal_1606 (Array Int Int))) (= (select (select (store .cse0 .cse1 v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86) .cse1)) (< v_prenex_86 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_86) (< (select (select (store .cse2 .cse1 v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86) 1))) (not (= (let ((.cse4 (+ .cse3 8))) (store (store (select .cse2 .cse1) .cse3 0) .cse4 (select v_ArrVal_1608 .cse4))) v_ArrVal_1608)))))) (< .cse3 0))))) (forall ((v_ArrVal_1603 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_1603))) (let ((.cse11 (select (select .cse6 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1608 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_1602))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_119| Int)) (or (< (select (select (store .cse6 .cse7 v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_119|) 0) (< |v_ULTIMATE.start_main_~end~0#1.offset_119| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_119|) (forall ((v_prenex_86 Int) (v_ArrVal_1606 (Array Int Int))) (let ((.cse9 (select (store .cse10 .cse7 v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse8 (select .cse9 |v_ULTIMATE.start_main_~end~0#1.offset_119|))) (or (= .cse7 .cse8) (= (select .cse9 v_prenex_86) .cse8))))))) (not (= (let ((.cse12 (+ .cse11 8))) (store (store (select .cse6 .cse7) .cse11 0) .cse12 (select v_ArrVal_1608 .cse12))) v_ArrVal_1608)))))) (< .cse11 0))))) (forall ((v_ArrVal_1603 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_1603))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1608 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_1602))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_prenex_86 Int) (v_ArrVal_1606 (Array Int Int))) (or (< v_prenex_86 0) (= (select (select (store .cse13 .cse14 v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86) .cse14) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_86) (< (select (select (store .cse15 .cse14 v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86) 1))) (not (= (let ((.cse17 (+ .cse16 8))) (store (store (select .cse15 .cse14) .cse16 0) .cse17 (select v_ArrVal_1608 .cse17))) v_ArrVal_1608)))))) (< .cse16 0))))) (forall ((v_ArrVal_1603 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_1603))) (let ((.cse21 (select (select .cse18 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1608 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_1602))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_119| Int)) (or (< (select (select (store .cse18 .cse19 v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_119|) 0) (forall ((v_ArrVal_1606 (Array Int Int))) (= .cse19 (select (select (store .cse20 .cse19 v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_119|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_119| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_119|))) (not (= (let ((.cse22 (+ .cse21 8))) (store (store (select .cse18 .cse19) .cse21 0) .cse22 (select v_ArrVal_1608 .cse22))) v_ArrVal_1608)))))) (< .cse21 0))))) (forall ((v_ArrVal_1603 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_1603))) (let ((.cse25 (select (select .cse23 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1608 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_1602))) (let ((.cse24 (select (select .cse27 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= (let ((.cse26 (+ .cse25 8))) (store (store (select .cse23 .cse24) .cse25 0) .cse26 (select v_ArrVal_1608 .cse26))) v_ArrVal_1608)) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_119| Int) (v_ArrVal_1606 (Array Int Int))) (or (< (select (select (store .cse23 .cse24 v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_119|) 0) (= .cse24 (select (select (store .cse27 .cse24 v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_119|)) (< |v_ULTIMATE.start_main_~end~0#1.offset_119| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_119|))))))) (< .cse25 0))))) (forall ((v_ArrVal_1603 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_1603))) (let ((.cse30 (select (select .cse28 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1608 (Array Int Int))) (let ((.cse29 (select (select (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_1602) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_prenex_86 Int)) (or (< v_prenex_86 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_86) (< (select (select (store .cse28 .cse29 v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86) (+ .cse30 1)))) (not (= (let ((.cse31 (+ .cse30 8))) (store (store (select .cse28 .cse29) .cse30 0) .cse31 (select v_ArrVal_1608 .cse31))) v_ArrVal_1608))))) (< .cse30 0))))) (forall ((v_ArrVal_1603 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_1603))) (let ((.cse32 (select (select .cse33 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (= .cse32 0) (forall ((v_ArrVal_1602 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_119| Int) (v_prenex_86 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1606 (Array Int Int))) (let ((.cse37 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_1602))) (let ((.cse34 (select (select .cse37 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (< (select (select (store .cse33 .cse34 v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_119|) 0) (< |v_ULTIMATE.start_main_~end~0#1.offset_119| 0) (not (= (let ((.cse35 (+ .cse32 8))) (store (store (select .cse33 .cse34) .cse32 0) .cse35 (select v_ArrVal_1608 .cse35))) v_ArrVal_1608)) (let ((.cse36 (select (store .cse37 .cse34 v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|))) (= (select .cse36 v_prenex_86) (select .cse36 |v_ULTIMATE.start_main_~end~0#1.offset_119|))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_119|))))) (< .cse32 0))))) (forall ((v_ArrVal_1603 (Array Int Int))) (let ((.cse38 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_1603))) (let ((.cse40 (select (select .cse38 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1602 (Array Int Int)) (v_prenex_86 Int) (v_ArrVal_1608 (Array Int Int))) (let ((.cse39 (select (select (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_1602) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (< v_prenex_86 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_86) (not (= (let ((.cse41 (+ .cse40 8))) (store (store (select .cse38 .cse39) .cse40 0) .cse41 (select v_ArrVal_1608 .cse41))) v_ArrVal_1608)) (< (select (select (store .cse38 .cse39 v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86) 1)))) (< .cse40 2))))) (forall ((v_ArrVal_1603 (Array Int Int))) (let ((.cse47 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_1603))) (let ((.cse42 (select (select .cse47 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (< .cse42 0) (forall ((v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1608 (Array Int Int))) (let ((.cse46 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_1602))) (let ((.cse44 (select (select .cse46 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_prenex_86 Int)) (or (< v_prenex_86 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_86) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_119| Int) (v_ArrVal_1606 (Array Int Int))) (let ((.cse45 (select (store .cse46 .cse44 v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse43 (select .cse45 v_prenex_86))) (or (= .cse43 .cse44) (= .cse43 (select .cse45 |v_ULTIMATE.start_main_~end~0#1.offset_119|)))))) (< (select (select (store .cse47 .cse44 v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86) 1))) (not (= (let ((.cse48 (+ .cse42 8))) (store (store (select .cse47 .cse44) .cse42 0) .cse48 (select v_ArrVal_1608 .cse48))) v_ArrVal_1608)))))))))) (forall ((v_ArrVal_1603 (Array Int Int))) (let ((.cse49 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_1603))) (let ((.cse51 (select (select .cse49 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1602 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_119| Int) (v_prenex_86 Int) (v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1606 (Array Int Int))) (let ((.cse54 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_1602))) (let ((.cse50 (select (select .cse54 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (< v_prenex_86 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_86) (not (= (let ((.cse52 (+ .cse51 8))) (store (store (select .cse49 .cse50) .cse51 0) .cse52 (select v_ArrVal_1608 .cse52))) v_ArrVal_1608)) (let ((.cse53 (select (store .cse54 .cse50 v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|))) (= (select .cse53 v_prenex_86) (select .cse53 |v_ULTIMATE.start_main_~end~0#1.offset_119|))) (< (select (select (store .cse49 .cse50 v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86) 1))))) (< .cse51 2))))) (forall ((v_ArrVal_1603 (Array Int Int))) (let ((.cse56 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_1603))) (let ((.cse55 (select (select .cse56 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (= .cse55 0) (forall ((v_ArrVal_1602 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_119| Int) (v_ArrVal_1608 (Array Int Int))) (let ((.cse57 (select (select (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_1602) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (< (select (select (store .cse56 .cse57 v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_119|) 0) (< |v_ULTIMATE.start_main_~end~0#1.offset_119| 0) (not (= (let ((.cse58 (+ .cse55 8))) (store (store (select .cse56 .cse57) .cse55 0) .cse58 (select v_ArrVal_1608 .cse58))) v_ArrVal_1608)) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_119|)))) (< .cse55 0))))) (forall ((v_ArrVal_1603 (Array Int Int))) (let ((.cse59 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_1603))) (let ((.cse61 (select (select .cse59 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1608 (Array Int Int))) (let ((.cse64 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_1602))) (let ((.cse60 (select (select .cse64 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= (let ((.cse62 (+ .cse61 8))) (store (store (select .cse59 .cse60) .cse61 0) .cse62 (select v_ArrVal_1608 .cse62))) v_ArrVal_1608)) (forall ((v_prenex_86 Int)) (or (< v_prenex_86 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_86) (< (select (select (store .cse59 .cse60 v_ArrVal_1608) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_86) (+ .cse61 1)) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_119| Int) (v_ArrVal_1606 (Array Int Int))) (let ((.cse63 (select (store .cse64 .cse60 v_ArrVal_1606) |c_ULTIMATE.start_main_~list~0#1.base|))) (= (select .cse63 v_prenex_86) (select .cse63 |v_ULTIMATE.start_main_~end~0#1.offset_119|)))))))))) (< .cse61 0))))))) is different from false [2024-11-28 04:29:50,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:29:50,480 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 144 treesize of output 104 [2024-11-28 04:29:50,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:29:50,502 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 155 treesize of output 115 [2024-11-28 04:29:50,692 INFO L349 Elim1Store]: treesize reduction 5, result has 83.9 percent of original size [2024-11-28 04:29:50,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 287 treesize of output 276 [2024-11-28 04:29:50,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:29:50,753 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 188 treesize of output 188 [2024-11-28 04:29:50,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2024-11-28 04:29:50,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:29:50,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 379 treesize of output 371 [2024-11-28 04:29:50,911 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:29:51,409 INFO L349 Elim1Store]: treesize reduction 155, result has 43.8 percent of original size [2024-11-28 04:29:51,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 150 treesize of output 274 [2024-11-28 04:30:00,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 48 treesize of output 44 [2024-11-28 04:30:12,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:30:12,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-28 04:30:12,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:30:12,594 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 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-28 04:30:12,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:30:12,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-28 04:30:13,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:30:13,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-28 04:30:13,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:30:13,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-28 04:30:14,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:30:14,747 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 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-28 04:30:14,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:30:14,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-28 04:30:15,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:30:15,129 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 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-28 04:30:15,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:30:15,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-28 04:30:15,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:30:15,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-28 04:30:15,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:30:15,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-28 04:30:15,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:30:15,866 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 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-28 04:30:16,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:30:16,596 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 1 case distinctions, treesize of input 22 treesize of output 8 [2024-11-28 04:30:21,063 INFO L224 Elim1Store]: Index analysis took 643 ms [2024-11-28 04:31:04,966 WARN L286 SmtUtils]: Spent 43.90s on a formula simplification. DAG size of input: 167 DAG size of output: 131 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-28 04:31:04,967 INFO L349 Elim1Store]: treesize reduction 188, result has 57.0 percent of original size [2024-11-28 04:31:04,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 8 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 9 new quantified variables, introduced 24 case distinctions, treesize of input 7976 treesize of output 9014