./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/splice-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/splice-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 098fc4cb5d15cb305e8d98bf2e1c69b111d102681b51dec68ae720515d6f30bc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:29:13,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:29:13,557 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-24 21:29:13,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:29:13,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:29:13,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:29:13,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:29:13,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:29:13,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:29:13,638 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:29:13,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:29:13,640 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:29:13,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:29:13,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:29:13,643 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:29:13,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:29:13,644 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 21:29:13,645 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:29:13,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:29:13,646 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:29:13,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:29:13,647 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 21:29:13,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:29:13,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 21:29:13,648 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:29:13,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 21:29:13,649 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:29:13,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:29:13,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:29:13,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:29:13,653 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:29:13,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:29:13,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:29:13,654 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:29:13,654 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 21:29:13,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:29:13,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:29:13,655 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:29:13,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:29:13,655 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 21:29:13,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:29:13,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:29:13,656 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI 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 ! call(reach_error())) ) 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 -> 098fc4cb5d15cb305e8d98bf2e1c69b111d102681b51dec68ae720515d6f30bc [2023-11-24 21:29:14,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:29:14,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:29:14,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:29:14,053 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:29:14,054 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:29:14,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/list-properties/splice-2.i [2023-11-24 21:29:17,247 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:29:17,632 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:29:17,634 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/sv-benchmarks/c/list-properties/splice-2.i [2023-11-24 21:29:17,661 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/data/4680815f9/eca662e6311a4a8d822df381a8ee49b9/FLAG23eac8ba9 [2023-11-24 21:29:17,683 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/data/4680815f9/eca662e6311a4a8d822df381a8ee49b9 [2023-11-24 21:29:17,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:29:17,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:29:17,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:29:17,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:29:17,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:29:17,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:29:17" (1/1) ... [2023-11-24 21:29:17,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a392b11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:29:17, skipping insertion in model container [2023-11-24 21:29:17,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:29:17" (1/1) ... [2023-11-24 21:29:17,740 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:29:18,087 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/sv-benchmarks/c/list-properties/splice-2.i[23721,23734] [2023-11-24 21:29:18,092 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:29:18,103 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:29:18,195 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/sv-benchmarks/c/list-properties/splice-2.i[23721,23734] [2023-11-24 21:29:18,206 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:29:18,243 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:29:18,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:29:18 WrapperNode [2023-11-24 21:29:18,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:29:18,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:29:18,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:29:18,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:29:18,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:29:18" (1/1) ... [2023-11-24 21:29:18,278 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:29:18" (1/1) ... [2023-11-24 21:29:18,302 INFO L138 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 104 [2023-11-24 21:29:18,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:29:18,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:29:18,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:29:18,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:29:18,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:29:18" (1/1) ... [2023-11-24 21:29:18,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:29:18" (1/1) ... [2023-11-24 21:29:18,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:29:18" (1/1) ... [2023-11-24 21:29:18,340 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2023-11-24 21:29:18,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:29:18" (1/1) ... [2023-11-24 21:29:18,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:29:18" (1/1) ... [2023-11-24 21:29:18,349 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:29:18" (1/1) ... [2023-11-24 21:29:18,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:29:18" (1/1) ... [2023-11-24 21:29:18,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:29:18" (1/1) ... [2023-11-24 21:29:18,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:29:18" (1/1) ... [2023-11-24 21:29:18,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:29:18,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:29:18,362 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:29:18,362 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:29:18,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:29:18" (1/1) ... [2023-11-24 21:29:18,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:29:18,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:29:18,414 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:29:18,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:29:18,460 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-24 21:29:18,460 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-24 21:29:18,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-24 21:29:18,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-24 21:29:18,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:29:18,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:29:18,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 21:29:18,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:29:18,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-24 21:29:18,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-24 21:29:18,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-24 21:29:18,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-24 21:29:18,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:29:18,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:29:18,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:29:18,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:29:18,586 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:29:18,588 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:29:18,614 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-24 21:29:18,817 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:29:18,847 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:29:18,847 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-24 21:29:18,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:29:18 BoogieIcfgContainer [2023-11-24 21:29:18,848 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:29:18,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:29:18,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:29:18,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:29:18,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:29:17" (1/3) ... [2023-11-24 21:29:18,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf8b443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:29:18, skipping insertion in model container [2023-11-24 21:29:18,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:29:18" (2/3) ... [2023-11-24 21:29:18,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf8b443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:29:18, skipping insertion in model container [2023-11-24 21:29:18,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:29:18" (3/3) ... [2023-11-24 21:29:18,864 INFO L112 eAbstractionObserver]: Analyzing ICFG splice-2.i [2023-11-24 21:29:18,885 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:29:18,886 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-24 21:29:18,937 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:29:18,944 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@4bfd5a86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:29:18,944 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 21:29:18,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 25 states have (on average 1.64) internal successors, (41), 27 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:18,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-24 21:29:18,958 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:29:18,958 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:29:18,959 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 21:29:18,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:29:18,965 INFO L85 PathProgramCache]: Analyzing trace with hash 285317644, now seen corresponding path program 1 times [2023-11-24 21:29:18,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:29:18,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721064745] [2023-11-24 21:29:18,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:29:18,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:29:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:29:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:29:19,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:29:19,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721064745] [2023-11-24 21:29:19,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721064745] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:29:19,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:29:19,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:29:19,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910854390] [2023-11-24 21:29:19,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:29:19,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 21:29:19,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:29:19,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 21:29:19,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 21:29:19,200 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.64) internal successors, (41), 27 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:19,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:29:19,231 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2023-11-24 21:29:19,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 21:29:19,234 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-11-24 21:29:19,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:29:19,241 INFO L225 Difference]: With dead ends: 45 [2023-11-24 21:29:19,242 INFO L226 Difference]: Without dead ends: 22 [2023-11-24 21:29:19,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 21:29:19,267 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 21:29:19,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 21:29:19,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-24 21:29:19,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-24 21:29:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-11-24 21:29:19,334 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 11 [2023-11-24 21:29:19,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:29:19,335 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-11-24 21:29:19,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:19,336 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2023-11-24 21:29:19,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-24 21:29:19,337 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:29:19,337 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:29:19,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:29:19,338 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 21:29:19,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:29:19,339 INFO L85 PathProgramCache]: Analyzing trace with hash -726011293, now seen corresponding path program 1 times [2023-11-24 21:29:19,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:29:19,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765593008] [2023-11-24 21:29:19,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:29:19,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:29:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:29:19,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:29:19,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:29:19,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765593008] [2023-11-24 21:29:19,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765593008] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:29:19,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:29:19,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:29:19,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341120056] [2023-11-24 21:29:19,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:29:19,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:29:19,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:29:19,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:29:19,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:29:19,600 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) [2023-11-24 21:29:19,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:29:19,710 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2023-11-24 21:29:19,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:29:19,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 [2023-11-24 21:29:19,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:29:19,713 INFO L225 Difference]: With dead ends: 44 [2023-11-24 21:29:19,713 INFO L226 Difference]: Without dead ends: 31 [2023-11-24 21:29:19,714 INFO L412 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 [2023-11-24 21:29:19,716 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:29:19,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 52 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:29:19,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-24 21:29:19,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2023-11-24 21:29:19,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:19,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-11-24 21:29:19,732 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 13 [2023-11-24 21:29:19,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:29:19,733 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-11-24 21:29:19,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) [2023-11-24 21:29:19,734 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2023-11-24 21:29:19,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-24 21:29:19,735 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:29:19,735 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:29:19,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:29:19,736 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 21:29:19,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:29:19,739 INFO L85 PathProgramCache]: Analyzing trace with hash -489421778, now seen corresponding path program 1 times [2023-11-24 21:29:19,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:29:19,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462085461] [2023-11-24 21:29:19,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:29:19,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:29:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:29:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 21:29:19,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:29:19,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462085461] [2023-11-24 21:29:19,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462085461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:29:19,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:29:19,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:29:19,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100506490] [2023-11-24 21:29:19,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:29:19,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:29:19,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:29:19,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:29:19,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:29:20,001 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:20,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:29:20,107 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2023-11-24 21:29:20,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:29:20,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-24 21:29:20,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:29:20,111 INFO L225 Difference]: With dead ends: 34 [2023-11-24 21:29:20,117 INFO L226 Difference]: Without dead ends: 26 [2023-11-24 21:29:20,120 INFO L412 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 [2023-11-24 21:29:20,123 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:29:20,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 67 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:29:20,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-24 21:29:20,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-24 21:29:20,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:20,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-11-24 21:29:20,136 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 19 [2023-11-24 21:29:20,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:29:20,137 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-11-24 21:29:20,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:20,137 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-11-24 21:29:20,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-24 21:29:20,138 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:29:20,139 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:29:20,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:29:20,139 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 21:29:20,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:29:20,143 INFO L85 PathProgramCache]: Analyzing trace with hash -612434823, now seen corresponding path program 1 times [2023-11-24 21:29:20,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:29:20,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935317353] [2023-11-24 21:29:20,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:29:20,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:29:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:29:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:29:20,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:29:20,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935317353] [2023-11-24 21:29:20,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935317353] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:29:20,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437814072] [2023-11-24 21:29:20,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:29:20,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:29:20,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:29:20,340 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:29:20,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 21:29:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:29:20,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-24 21:29:20,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:29:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 21:29:20,531 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:29:20,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437814072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:29:20,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 21:29:20,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-11-24 21:29:20,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743524310] [2023-11-24 21:29:20,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:29:20,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:29:20,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:29:20,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:29:20,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:29:20,538 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:20,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:29:20,574 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2023-11-24 21:29:20,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:29:20,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 22 [2023-11-24 21:29:20,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:29:20,579 INFO L225 Difference]: With dead ends: 66 [2023-11-24 21:29:20,580 INFO L226 Difference]: Without dead ends: 45 [2023-11-24 21:29:20,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:29:20,581 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 20 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 21:29:20,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 62 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 21:29:20,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-24 21:29:20,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2023-11-24 21:29:20,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:20,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2023-11-24 21:29:20,592 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 22 [2023-11-24 21:29:20,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:29:20,593 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2023-11-24 21:29:20,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:20,594 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2023-11-24 21:29:20,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-24 21:29:20,595 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:29:20,595 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:29:20,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-24 21:29:20,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:29:20,802 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 21:29:20,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:29:20,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1907525111, now seen corresponding path program 1 times [2023-11-24 21:29:20,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:29:20,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717133938] [2023-11-24 21:29:20,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:29:20,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:29:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:29:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:29:21,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:29:21,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717133938] [2023-11-24 21:29:21,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717133938] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:29:21,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087342072] [2023-11-24 21:29:21,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:29:21,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:29:21,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:29:21,726 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:29:21,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 21:29:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:29:21,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-24 21:29:21,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:29:21,905 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 [2023-11-24 21:29:22,010 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 [2023-11-24 21:29:22,067 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 21:29:22,068 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 [2023-11-24 21:29:22,140 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 [2023-11-24 21:29:22,209 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 [2023-11-24 21:29:22,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-24 21:29:22,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:29:22,334 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:29:22,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:22,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-11-24 21:29:22,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:22,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2023-11-24 21:29:22,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-24 21:29:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:29:22,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087342072] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:29:22,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:29:22,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2023-11-24 21:29:22,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762622615] [2023-11-24 21:29:22,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:29:22,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-24 21:29:22,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:29:22,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-24 21:29:22,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=580, Unknown=5, NotChecked=0, Total=702 [2023-11-24 21:29:22,857 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:29:23,645 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2023-11-24 21:29:23,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-24 21:29:23,646 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 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 22 [2023-11-24 21:29:23,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:29:23,647 INFO L225 Difference]: With dead ends: 56 [2023-11-24 21:29:23,647 INFO L226 Difference]: Without dead ends: 54 [2023-11-24 21:29:23,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=277, Invalid=1049, Unknown=6, NotChecked=0, Total=1332 [2023-11-24 21:29:23,651 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 178 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 21:29:23,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 140 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 21:29:23,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-24 21:29:23,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2023-11-24 21:29:23,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:23,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2023-11-24 21:29:23,666 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 22 [2023-11-24 21:29:23,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:29:23,666 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2023-11-24 21:29:23,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:23,667 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2023-11-24 21:29:23,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-24 21:29:23,667 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:29:23,668 INFO L195 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] [2023-11-24 21:29:23,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 21:29:23,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:29:23,875 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 21:29:23,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:29:23,875 INFO L85 PathProgramCache]: Analyzing trace with hash -821079412, now seen corresponding path program 1 times [2023-11-24 21:29:23,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:29:23,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528595211] [2023-11-24 21:29:23,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:29:23,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:29:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:29:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 21:29:23,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:29:23,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528595211] [2023-11-24 21:29:23,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528595211] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:29:23,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544671592] [2023-11-24 21:29:23,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:29:23,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:29:23,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:29:23,975 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:29:23,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 21:29:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:29:24,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-24 21:29:24,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:29:24,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 21:29:24,127 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:29:24,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 21:29:24,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544671592] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:29:24,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:29:24,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2023-11-24 21:29:24,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596124594] [2023-11-24 21:29:24,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:29:24,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:29:24,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:29:24,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:29:24,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:29:24,174 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:24,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:29:24,316 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2023-11-24 21:29:24,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 21:29:24,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-24 21:29:24,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:29:24,319 INFO L225 Difference]: With dead ends: 71 [2023-11-24 21:29:24,319 INFO L226 Difference]: Without dead ends: 66 [2023-11-24 21:29:24,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-11-24 21:29:24,320 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 111 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:29:24,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 59 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:29:24,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-24 21:29:24,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2023-11-24 21:29:24,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:24,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2023-11-24 21:29:24,334 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 24 [2023-11-24 21:29:24,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:29:24,334 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2023-11-24 21:29:24,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:24,335 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2023-11-24 21:29:24,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-24 21:29:24,336 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:29:24,336 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:29:24,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-24 21:29:24,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:29:24,542 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 21:29:24,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:29:24,543 INFO L85 PathProgramCache]: Analyzing trace with hash -819369390, now seen corresponding path program 1 times [2023-11-24 21:29:24,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:29:24,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326467802] [2023-11-24 21:29:24,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:29:24,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:29:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:29:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:29:25,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:29:25,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326467802] [2023-11-24 21:29:25,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326467802] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:29:25,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938208007] [2023-11-24 21:29:25,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:29:25,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:29:25,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:29:25,137 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:29:25,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 21:29:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:29:25,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-24 21:29:25,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:29:25,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-24 21:29:25,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-24 21:29:25,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 21:29:25,387 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:29:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 21:29:25,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938208007] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:29:25,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:29:25,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2023-11-24 21:29:25,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312049442] [2023-11-24 21:29:25,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:29:25,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-24 21:29:25,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:29:25,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-24 21:29:25,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-24 21:29:25,440 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:25,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:29:25,694 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2023-11-24 21:29:25,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 21:29:25,695 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-24 21:29:25,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:29:25,696 INFO L225 Difference]: With dead ends: 63 [2023-11-24 21:29:25,696 INFO L226 Difference]: Without dead ends: 56 [2023-11-24 21:29:25,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2023-11-24 21:29:25,697 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 55 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:29:25,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 81 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:29:25,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-24 21:29:25,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2023-11-24 21:29:25,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:25,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2023-11-24 21:29:25,711 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 24 [2023-11-24 21:29:25,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:29:25,711 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2023-11-24 21:29:25,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:25,712 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2023-11-24 21:29:25,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-24 21:29:25,713 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:29:25,713 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:29:25,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-24 21:29:25,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-24 21:29:25,921 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 21:29:25,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:29:25,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1293927920, now seen corresponding path program 1 times [2023-11-24 21:29:25,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:29:25,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872488102] [2023-11-24 21:29:25,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:29:25,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:29:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:29:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:29:26,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:29:26,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872488102] [2023-11-24 21:29:26,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872488102] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:29:26,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831274523] [2023-11-24 21:29:26,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:29:26,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:29:26,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:29:26,695 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:29:26,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-24 21:29:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:29:26,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-24 21:29:26,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:29:26,836 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 [2023-11-24 21:29:26,946 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 21:29:26,947 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 [2023-11-24 21:29:27,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-24 21:29:27,026 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 [2023-11-24 21:29:27,112 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 21:29:27,112 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 64 treesize of output 57 [2023-11-24 21:29:27,120 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 23 treesize of output 15 [2023-11-24 21:29:27,125 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 32 treesize of output 19 [2023-11-24 21:29:27,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-11-24 21:29:27,230 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 19 treesize of output 11 [2023-11-24 21:29:27,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 [2023-11-24 21:29:27,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-24 21:29:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:29:27,353 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:29:27,423 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_350) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 3)) is different from false [2023-11-24 21:29:27,509 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_350 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_350) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 3)) is different from false [2023-11-24 21:29:27,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:27,520 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 36 treesize of output 37 [2023-11-24 21:29:27,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:27,533 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 75 treesize of output 78 [2023-11-24 21:29:27,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2023-11-24 21:29:27,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:27,725 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 23 treesize of output 24 [2023-11-24 21:29:27,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:27,735 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 39 treesize of output 38 [2023-11-24 21:29:27,740 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 22 treesize of output 18 [2023-11-24 21:29:27,761 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-24 21:29:27,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-11-24 21:29:27,768 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-24 21:29:27,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-11-24 21:29:27,984 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:29:27,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831274523] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:29:27,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:29:27,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 32 [2023-11-24 21:29:27,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419237567] [2023-11-24 21:29:27,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:29:27,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-24 21:29:27,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:29:27,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-24 21:29:27,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=8, NotChecked=118, Total=1056 [2023-11-24 21:29:27,988 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:29,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:29:29,430 INFO L93 Difference]: Finished difference Result 113 states and 139 transitions. [2023-11-24 21:29:29,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 21:29:29,431 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 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 [2023-11-24 21:29:29,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:29:29,432 INFO L225 Difference]: With dead ends: 113 [2023-11-24 21:29:29,432 INFO L226 Difference]: Without dead ends: 94 [2023-11-24 21:29:29,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=291, Invalid=2258, Unknown=9, NotChecked=198, Total=2756 [2023-11-24 21:29:29,435 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 206 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-24 21:29:29,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 390 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 717 Invalid, 0 Unknown, 192 Unchecked, 0.6s Time] [2023-11-24 21:29:29,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-24 21:29:29,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 60. [2023-11-24 21:29:29,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 59 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:29,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2023-11-24 21:29:29,455 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 25 [2023-11-24 21:29:29,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:29:29,455 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2023-11-24 21:29:29,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:29,456 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2023-11-24 21:29:29,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-24 21:29:29,458 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:29:29,458 INFO L195 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] [2023-11-24 21:29:29,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-24 21:29:29,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-24 21:29:29,665 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 21:29:29,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:29:29,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1436644313, now seen corresponding path program 1 times [2023-11-24 21:29:29,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:29:29,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486668718] [2023-11-24 21:29:29,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:29:29,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:29:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:29:29,768 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-24 21:29:29,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:29:29,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486668718] [2023-11-24 21:29:29,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486668718] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:29:29,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:29:29,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:29:29,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483956442] [2023-11-24 21:29:29,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:29:29,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:29:29,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:29:29,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:29:29,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:29:29,772 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:29,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:29:29,830 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2023-11-24 21:29:29,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:29:29,831 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-24 21:29:29,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:29:29,833 INFO L225 Difference]: With dead ends: 74 [2023-11-24 21:29:29,833 INFO L226 Difference]: Without dead ends: 57 [2023-11-24 21:29:29,834 INFO L412 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 [2023-11-24 21:29:29,837 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 21:29:29,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 63 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 21:29:29,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-24 21:29:29,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2023-11-24 21:29:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2023-11-24 21:29:29,864 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 26 [2023-11-24 21:29:29,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:29:29,864 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2023-11-24 21:29:29,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:29,865 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2023-11-24 21:29:29,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-24 21:29:29,867 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:29:29,867 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:29:29,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:29:29,867 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 21:29:29,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:29:29,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1062138715, now seen corresponding path program 2 times [2023-11-24 21:29:29,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:29:29,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614770921] [2023-11-24 21:29:29,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:29:29,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:29:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:29:29,915 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-24 21:29:29,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:29:29,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614770921] [2023-11-24 21:29:29,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614770921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:29:29,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:29:29,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:29:29,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779946928] [2023-11-24 21:29:29,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:29:29,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:29:29,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:29:29,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:29:29,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:29:29,918 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:29,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:29:29,943 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2023-11-24 21:29:29,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:29:29,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-24 21:29:29,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:29:29,944 INFO L225 Difference]: With dead ends: 103 [2023-11-24 21:29:29,944 INFO L226 Difference]: Without dead ends: 59 [2023-11-24 21:29:29,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:29:29,947 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 15 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 21:29:29,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 65 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 21:29:29,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-24 21:29:29,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2023-11-24 21:29:29,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:29,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2023-11-24 21:29:29,966 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 31 [2023-11-24 21:29:29,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:29:29,966 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2023-11-24 21:29:29,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:29:29,967 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2023-11-24 21:29:29,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-24 21:29:29,973 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:29:29,973 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:29:29,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:29:29,974 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 21:29:29,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:29:29,975 INFO L85 PathProgramCache]: Analyzing trace with hash 244490265, now seen corresponding path program 1 times [2023-11-24 21:29:29,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:29:29,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408566247] [2023-11-24 21:29:29,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:29:29,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:29:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:29:31,098 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:29:31,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:29:31,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408566247] [2023-11-24 21:29:31,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408566247] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:29:31,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199263190] [2023-11-24 21:29:31,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:29:31,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:29:31,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:29:31,101 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:29:31,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_039f03ac-aa98-4224-b298-b114f2d408f3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-24 21:29:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:29:31,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-24 21:29:31,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:29:31,259 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 [2023-11-24 21:29:31,337 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 [2023-11-24 21:29:31,400 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 21:29:31,401 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 [2023-11-24 21:29:31,438 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 [2023-11-24 21:29:31,449 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 [2023-11-24 21:29:31,538 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 21:29:31,538 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 [2023-11-24 21:29:31,555 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-24 21:29:31,556 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 [2023-11-24 21:29:31,663 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 21:29:31,664 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 [2023-11-24 21:29:31,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 [2023-11-24 21:29:31,742 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 21:29:31,742 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 17 treesize of output 16 [2023-11-24 21:29:31,757 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-24 21:29:31,758 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 1 case distinctions, treesize of input 19 treesize of output 22 [2023-11-24 21:29:31,766 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 [2023-11-24 21:29:31,982 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 [2023-11-24 21:29:32,062 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 21:29:32,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2023-11-24 21:29:32,191 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-24 21:29:32,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2023-11-24 21:29:32,286 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:29:32,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:29:32,309 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_538 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_main_~l1~0#1.base|) |c_ULTIMATE.start_main_~l1~0#1.offset|) 1)) is different from false [2023-11-24 21:29:32,380 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_main_~t~0#1.base|) |c_ULTIMATE.start_main_~t~0#1.offset|) 1) (not (= v_ArrVal_537 (let ((.cse0 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base|) .cse0 (select v_ArrVal_537 .cse0))))))) is different from false [2023-11-24 21:29:32,400 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= v_ArrVal_537 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_537 .cse0)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_537) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) v_ArrVal_538) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1)))) (= 3 |c_ULTIMATE.start_main_#t~mem8#1|)) is different from false [2023-11-24 21:29:32,428 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|))) (or (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= v_ArrVal_537 (store .cse0 .cse1 (select v_ArrVal_537 .cse1)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_537) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1) v_ArrVal_538) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1)))) (= (select .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|) 3))) is different from false [2023-11-24 21:29:32,456 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_537 (store .cse0 .cse1 (select v_ArrVal_537 .cse1))))))))) is different from false [2023-11-24 21:29:32,487 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse1 (store |c_#memory_int#1| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int#1| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_535) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_537 (store .cse0 .cse2 (select v_ArrVal_537 .cse2))))))))))) is different from false [2023-11-24 21:29:32,549 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_533 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (let ((.cse2 (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_532))) (store .cse3 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_59|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (not (= v_ArrVal_537 (store .cse0 .cse1 (select v_ArrVal_537 .cse1)))) (= (select (select (store (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_533) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_535) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 3))))) is different from false [2023-11-24 21:29:32,590 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_533 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (let ((.cse2 (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_532))) (store .cse3 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (not (= v_ArrVal_537 (store .cse0 .cse1 (select v_ArrVal_537 .cse1)))) (= (select (select (store (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_533) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_535) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 3))))) is different from false [2023-11-24 21:29:32,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:32,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 70 [2023-11-24 21:29:32,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:32,689 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 246 treesize of output 245 [2023-11-24 21:29:32,704 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 116 treesize of output 112 [2023-11-24 21:29:32,714 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 226 treesize of output 218 [2023-11-24 21:29:34,102 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse25 (and (forall ((v_arrayElimCell_38 Int) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse39 (let ((.cse40 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse4 .cse5 v_ArrVal_526)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (store .cse40 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse40 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))))) (let ((.cse37 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_537 (Array Int Int)) (v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int))) (let ((.cse38 (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537))) (or (not (= v_ArrVal_537 (store .cse37 .cse2 (select v_ArrVal_537 .cse2)))) (= (select (select (store .cse38 v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse38 v_arrayElimCell_38 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|) 3))))) (or .cse15 (and (forall ((v_arrayElimCell_38 Int) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse43 (let ((.cse44 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse4 .cse5 v_ArrVal_526)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (store .cse44 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse44 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))))) (let ((.cse41 (select .cse43 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_537 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse41 .cse2 (select v_ArrVal_537 .cse2)))) (forall ((v_arrayElimCell_41 Int) (v_ArrVal_538 (Array Int Int))) (let ((.cse42 (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537))) (or (= (select (select (store .cse42 v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse42 v_arrayElimCell_38 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))))) (= (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|) 3))))) (forall ((v_arrayElimCell_38 Int) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse46 (let ((.cse47 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse4 .cse5 v_ArrVal_526)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (store .cse47 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse47 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))))) (let ((.cse45 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse45 .cse2 (select v_ArrVal_537 .cse2)))) (= (select (select (store (store .cse46 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) v_arrayElimCell_38 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))))) (forall ((v_arrayElimCell_38 Int) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse49 (let ((.cse51 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse4 .cse5 v_ArrVal_526)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (store .cse51 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse51 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))))) (let ((.cse50 (select .cse49 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_537 (Array Int Int))) (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int))) (let ((.cse48 (store .cse49 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537))) (or (= (select (select (store .cse48 v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse48 v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse48 v_arrayElimCell_38 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (not (= v_ArrVal_537 (store .cse50 .cse2 (select v_ArrVal_537 .cse2)))))) (= (select .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)))))))) (and (forall ((v_ArrVal_537 (Array Int Int)) (v_arrayElimCell_41 Int) (v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse4 .cse5 v_ArrVal_526)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (let ((.cse1 (store (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) 0 3)) (.cse0 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537))) (or (= (select (select (store .cse0 v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (not (= v_ArrVal_537 (store .cse1 .cse2 (select v_ArrVal_537 .cse2)))) (= (select (select (store .cse0 v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (or (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse4 .cse5 v_ArrVal_526)))) (let ((.cse10 (store .cse8 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (let ((.cse9 (store (select .cse10 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) (let ((.cse7 (store .cse10 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse9))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (forall ((v_ArrVal_537 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse6 .cse2 (select v_ArrVal_537 .cse2)))) (forall ((v_arrayElimCell_41 Int) (v_ArrVal_538 (Array Int Int))) (or (= (select (select (store (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store (store (store .cse8 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse9) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))))))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse4 .cse5 v_ArrVal_526)))) (let ((.cse14 (store .cse12 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (let ((.cse13 (store (select .cse14 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) (let ((.cse11 (select (store .cse14 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse13) |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse11 .cse2 (select v_ArrVal_537 .cse2)))) (= (select (select (store (store (store .cse12 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse13) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (= (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)))))))) .cse15) (forall ((v_ArrVal_537 (Array Int Int)) (v_arrayElimCell_41 Int) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse4 .cse5 v_ArrVal_526)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (let ((.cse16 (store (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|) 0 3))) (or (= (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (not (= v_ArrVal_537 (store .cse16 .cse2 (select v_ArrVal_537 .cse2)))) (= (select (select (store (store .cse17 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (or (not .cse15) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse20 (let ((.cse21 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse4 .cse5 v_ArrVal_526)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (store .cse21 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse21 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))))) (let ((.cse18 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (forall ((v_ArrVal_537 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse18 .cse2 (select v_ArrVal_537 .cse2)))) (forall ((v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537))) (or (forall ((v_arrayElimCell_41 Int)) (= (select (select (store .cse19 v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= (select (select (store .cse19 v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse23 (let ((.cse24 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse4 .cse5 v_ArrVal_526)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (store .cse24 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse24 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))))) (let ((.cse22 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_537 (Array Int Int)) (v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse22 .cse2 (select v_ArrVal_537 .cse2)))) (= (select (select (store (store .cse23 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (= (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|) 3))))))) (or .cse25 (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse4 .cse5 v_ArrVal_526)))) (let ((.cse30 (store .cse28 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (let ((.cse29 (store (select .cse30 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) (let ((.cse27 (store .cse30 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse29))) (let ((.cse26 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_537 (Array Int Int)) (v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse26 .cse2 (select v_ArrVal_537 .cse2)))) (= (select (select (store (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store (store (store .cse28 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse29) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (= (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)))))))) (or .cse25 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse4 .cse5 v_ArrVal_526)))) (let ((.cse36 (store .cse33 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (let ((.cse34 (store (select .cse36 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) (let ((.cse35 (store .cse36 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse34))) (let ((.cse31 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_537 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse31 .cse2 (select v_ArrVal_537 .cse2)))) (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int))) (let ((.cse32 (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537))) (or (= (select (select (store .cse32 v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse32 v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store (store (store .cse33 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse34) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))))) (= (select .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|) 3))))))))))) is different from false [2023-11-24 21:29:40,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:40,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 206 treesize of output 120 [2023-11-24 21:29:40,082 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:29:40,163 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2023-11-24 21:29:40,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 case distinctions, treesize of input 248 treesize of output 273 [2023-11-24 21:29:40,245 INFO L349 Elim1Store]: treesize reduction 26, result has 58.7 percent of original size [2023-11-24 21:29:40,246 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 122 treesize of output 144 [2023-11-24 21:29:40,270 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:29:40,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:40,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 60 [2023-11-24 21:29:40,377 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 50 treesize of output 46 [2023-11-24 21:29:40,607 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 [2023-11-24 21:29:40,632 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-24 21:29:40,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:40,693 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 26 treesize of output 30 [2023-11-24 21:29:40,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:40,729 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 26 treesize of output 30 [2023-11-24 21:29:40,843 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 [2023-11-24 21:29:40,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:40,980 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 36 treesize of output 36 [2023-11-24 21:29:41,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:41,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 259 treesize of output 147 [2023-11-24 21:29:41,105 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2023-11-24 21:29:41,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 480 treesize of output 501 [2023-11-24 21:29:41,174 INFO L349 Elim1Store]: treesize reduction 37, result has 54.3 percent of original size [2023-11-24 21:29:41,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 320 treesize of output 331 [2023-11-24 21:29:41,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:41,297 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 57 treesize of output 75 [2023-11-24 21:29:41,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 136 [2023-11-24 21:29:41,581 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 [2023-11-24 21:29:41,650 INFO L349 Elim1Store]: treesize reduction 17, result has 37.0 percent of original size [2023-11-24 21:29:41,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 30 [2023-11-24 21:29:41,730 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-24 21:29:41,777 INFO L349 Elim1Store]: treesize reduction 17, result has 37.0 percent of original size [2023-11-24 21:29:41,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 30 [2023-11-24 21:29:42,026 INFO L349 Elim1Store]: treesize reduction 17, result has 37.0 percent of original size [2023-11-24 21:29:42,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 30 [2023-11-24 21:29:42,093 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 124 treesize of output 116 [2023-11-24 21:29:42,229 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 21 treesize of output 17 [2023-11-24 21:29:42,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:42,269 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 53 treesize of output 55 [2023-11-24 21:29:42,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:42,380 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 23 treesize of output 25 [2023-11-24 21:29:42,401 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 21:29:42,402 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 1 [2023-11-24 21:29:42,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:42,432 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 209 treesize of output 123 [2023-11-24 21:29:42,438 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:29:42,439 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:29:42,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 160 [2023-11-24 21:29:42,450 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 [2023-11-24 21:29:42,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 99 treesize of output 91 [2023-11-24 21:29:42,474 INFO L349 Elim1Store]: treesize reduction 13, result has 31.6 percent of original size [2023-11-24 21:29:42,475 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 2 case distinctions, treesize of input 56 treesize of output 40 [2023-11-24 21:29:42,537 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 [2023-11-24 21:29:42,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:42,550 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 156 treesize of output 96 [2023-11-24 21:29:42,556 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:29:42,557 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:29:42,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 121 treesize of output 111 [2023-11-24 21:29:42,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-11-24 21:29:42,583 INFO L349 Elim1Store]: treesize reduction 13, result has 31.6 percent of original size [2023-11-24 21:29:42,584 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 2 case distinctions, treesize of input 56 treesize of output 40 [2023-11-24 21:29:42,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-11-24 21:29:42,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-24 21:29:42,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:42,652 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 262 treesize of output 150 [2023-11-24 21:29:42,658 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:29:42,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:42,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 311 treesize of output 313 [2023-11-24 21:29:42,737 INFO L349 Elim1Store]: treesize reduction 26, result has 58.7 percent of original size [2023-11-24 21:29:42,737 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 122 treesize of output 144 [2023-11-24 21:29:42,766 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 148 treesize of output 136 [2023-11-24 21:29:42,792 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 [2023-11-24 21:29:42,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:42,882 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 26 treesize of output 30 [2023-11-24 21:29:42,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:42,921 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 26 treesize of output 30 [2023-11-24 21:29:43,053 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 [2023-11-24 21:29:43,071 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 [2023-11-24 21:29:43,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:43,084 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 209 treesize of output 123 [2023-11-24 21:29:43,089 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:29:43,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:43,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 262 treesize of output 264 [2023-11-24 21:29:43,177 INFO L349 Elim1Store]: treesize reduction 26, result has 58.7 percent of original size [2023-11-24 21:29:43,177 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 122 treesize of output 144 [2023-11-24 21:29:43,202 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 99 treesize of output 91 [2023-11-24 21:29:43,234 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 [2023-11-24 21:29:43,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:43,308 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 26 treesize of output 30 [2023-11-24 21:29:43,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:43,364 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 26 treesize of output 30 [2023-11-24 21:29:43,474 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 [2023-11-24 21:29:43,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:43,507 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 44 treesize of output 44 [2023-11-24 21:29:43,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:43,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 69 [2023-11-24 21:29:43,537 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:29:43,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:43,545 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 56 treesize of output 58 [2023-11-24 21:29:43,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-24 21:29:43,563 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 [2023-11-24 21:29:43,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:43,573 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 24 treesize of output 28 [2023-11-24 21:29:43,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:43,621 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 209 treesize of output 123 [2023-11-24 21:29:43,628 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:29:43,628 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:29:43,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:43,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 168 [2023-11-24 21:29:43,648 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 99 treesize of output 91 [2023-11-24 21:29:43,666 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 6 treesize of output 4 [2023-11-24 21:29:43,722 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 16 treesize of output 12 [2023-11-24 21:29:43,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:43,739 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 156 treesize of output 96 [2023-11-24 21:29:43,745 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:29:43,746 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:29:43,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:43,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 119 [2023-11-24 21:29:43,764 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 50 treesize of output 46 [2023-11-24 21:29:43,780 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 6 treesize of output 4 [2023-11-24 21:29:43,819 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 16 treesize of output 12 [2023-11-24 21:29:43,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:43,834 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 262 treesize of output 150 [2023-11-24 21:29:43,840 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:29:43,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:43,866 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 311 treesize of output 321 [2023-11-24 21:29:43,934 INFO L349 Elim1Store]: treesize reduction 26, result has 58.7 percent of original size [2023-11-24 21:29:43,935 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 122 treesize of output 144 [2023-11-24 21:29:43,964 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 148 treesize of output 136 [2023-11-24 21:29:44,020 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 6 treesize of output 4 [2023-11-24 21:29:44,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:44,094 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 26 treesize of output 30 [2023-11-24 21:29:44,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:44,139 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 26 treesize of output 30 [2023-11-24 21:29:44,265 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 6 treesize of output 4 [2023-11-24 21:29:44,285 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 16 treesize of output 12 [2023-11-24 21:29:44,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:44,302 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 209 treesize of output 123 [2023-11-24 21:29:44,307 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:29:44,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:44,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 262 treesize of output 272 [2023-11-24 21:29:44,390 INFO L349 Elim1Store]: treesize reduction 26, result has 58.7 percent of original size [2023-11-24 21:29:44,391 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 122 treesize of output 144 [2023-11-24 21:29:44,418 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 99 treesize of output 91 [2023-11-24 21:29:44,488 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 6 treesize of output 4 [2023-11-24 21:29:44,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:44,539 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 26 treesize of output 30 [2023-11-24 21:29:44,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:44,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2023-11-24 21:29:44,734 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 6 treesize of output 4 [2023-11-24 21:29:44,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:44,766 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 27 treesize of output 37 [2023-11-24 21:29:44,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:44,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 206 treesize of output 120 [2023-11-24 21:29:44,805 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:29:44,806 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:29:44,847 INFO L349 Elim1Store]: treesize reduction 21, result has 62.5 percent of original size [2023-11-24 21:29:44,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 156 treesize of output 172 [2023-11-24 21:29:44,860 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:29:44,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:44,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 98 [2023-11-24 21:29:44,898 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 50 treesize of output 46 [2023-11-24 21:29:44,948 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 [2023-11-24 21:29:45,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:45,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2023-11-24 21:29:45,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:45,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 85 [2023-11-24 21:29:45,044 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:29:45,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:45,056 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 75 treesize of output 77 [2023-11-24 21:29:45,064 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 [2023-11-24 21:29:45,076 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 [2023-11-24 21:29:45,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:45,098 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 24 treesize of output 28 [2023-11-24 21:29:45,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:45,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 153 treesize of output 93 [2023-11-24 21:29:45,131 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:29:45,132 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:29:45,189 INFO L349 Elim1Store]: treesize reduction 21, result has 62.5 percent of original size [2023-11-24 21:29:45,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 107 treesize of output 123 [2023-11-24 21:29:45,198 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:29:45,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:45,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 98 [2023-11-24 21:29:45,254 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 [2023-11-24 21:29:45,263 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 [2023-11-24 21:29:45,299 INFO L349 Elim1Store]: treesize reduction 36, result has 35.7 percent of original size [2023-11-24 21:29:45,300 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 4 case distinctions, treesize of input 70 treesize of output 65 [2023-11-24 21:29:45,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:29:45,385 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 27 treesize of output 29 [2023-11-24 21:29:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2023-11-24 21:29:52,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199263190] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:29:52,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:29:52,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 44 [2023-11-24 21:29:52,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080737376] [2023-11-24 21:29:52,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:29:52,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-24 21:29:52,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:29:52,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-24 21:29:52,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1125, Unknown=25, NotChecked=684, Total=1980 [2023-11-24 21:29:52,986 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 45 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 44 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:30:05,199 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse7 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse6 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|))) (let ((.cse20 (select .cse6 0)) (.cse22 (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_29| Int)) (or (= |v_ULTIMATE.start_main_~t~0#1.base_29| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimCell_38 Int) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse44 (let ((.cse45 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_526)) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_532))) (store .cse45 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse45 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))))) (let ((.cse43 (select .cse44 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select .cse43 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse43 .cse2 (select v_ArrVal_537 .cse2)))) (= (select (select (store (store .cse44 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) v_arrayElimCell_38 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_29| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0)) (forall ((v_arrayElimCell_38 Int) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse48 (let ((.cse49 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_526)) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_532))) (store .cse49 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse49 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))))) (let ((.cse46 (select .cse48 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (forall ((v_ArrVal_537 (Array Int Int))) (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int))) (let ((.cse47 (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537))) (or (= (select (select (store .cse47 v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse47 v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse47 v_arrayElimCell_38 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (not (= v_ArrVal_537 (store .cse46 .cse2 (select v_ArrVal_537 .cse2)))))))))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_29| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0)) (forall ((v_arrayElimCell_38 Int) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse52 (let ((.cse53 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_526)) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_532))) (store .cse53 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse53 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))))) (let ((.cse50 (select .cse52 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (forall ((v_ArrVal_537 (Array Int Int)) (v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int))) (let ((.cse51 (store .cse52 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537))) (or (= (select (select (store .cse51 v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_537 (store .cse50 .cse2 (select v_ArrVal_537 .cse2)))) (= (select (select (store .cse51 v_arrayElimCell_38 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))))))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_29| Int)) (or (= |v_ULTIMATE.start_main_~t~0#1.base_29| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimCell_38 Int) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse56 (let ((.cse57 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_526)) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_532))) (store .cse57 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse57 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))))) (let ((.cse54 (select .cse56 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (forall ((v_ArrVal_537 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse54 .cse2 (select v_ArrVal_537 .cse2)))) (forall ((v_arrayElimCell_41 Int) (v_ArrVal_538 (Array Int Int))) (let ((.cse55 (store .cse56 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537))) (or (= (select (select (store .cse55 v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse55 v_arrayElimCell_38 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0)))))) (.cse21 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse23 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse0 1) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_29| Int)) (or (= |v_ULTIMATE.start_main_~t~0#1.base_29| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_526)))) (let ((.cse5 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_532))) (let ((.cse4 (store (select .cse5 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) (let ((.cse1 (select (store .cse5 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse1 .cse2 (select v_ArrVal_537 .cse2)))) (= (select (select (store (store (store .cse3 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse4) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_29| Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_526)))) (let ((.cse13 (store .cse10 |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_532))) (let ((.cse11 (store (select .cse13 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) (let ((.cse12 (store .cse13 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse11))) (let ((.cse8 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (forall ((v_ArrVal_537 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse8 .cse2 (select v_ArrVal_537 .cse2)))) (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int))) (let ((.cse9 (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537))) (or (= (select (select (store .cse9 v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse9 v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store (store (store .cse10 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse11) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_29| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0)) (forall ((v_ArrVal_537 (Array Int Int)) (v_arrayElimCell_41 Int) (v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_526)) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_532))) (let ((.cse14 (store .cse16 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537)) (.cse15 (store (select .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) 0 3))) (or (= (select (select (store .cse14 v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse14 v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_537 (store .cse15 .cse2 (select v_ArrVal_537 .cse2)))) (= 3 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_29| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0)) (forall ((v_ArrVal_537 (Array Int Int)) (v_arrayElimCell_41 Int) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_526)) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_532))) (let ((.cse18 (store (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|) 0 3))) (or (= (select (select (store (store .cse17 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_537 (store .cse18 .cse2 (select v_ArrVal_537 .cse2)))) (= 3 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (let ((.cse19 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base|) 0))) (or (and (not (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4) |c_ULTIMATE.start_main_~a~0#1.base|)) (exists ((|ULTIMATE.start_main_~p~0#1.base| Int)) (= (select (select |c_#memory_int#1| |ULTIMATE.start_main_~p~0#1.base|) 0) 3)) (= .cse19 1)) (= .cse19 3))) (or (= 3 .cse20) (and (not (= (select .cse21 4) |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse20 1) (exists ((v_subst_1 Int)) (= 3 (select (select |c_#memory_int#1| v_subst_1) 0))))) (= .cse20 |c_ULTIMATE.start_main_#t~mem8#1|) (= |c_ULTIMATE.start_main_~flag~0#1| .cse0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or .cse22 .cse23) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse22) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_29| Int)) (or (= |v_ULTIMATE.start_main_~t~0#1.base_29| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_526)))) (let ((.cse28 (store .cse26 |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_532))) (let ((.cse27 (store (select .cse28 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) (let ((.cse25 (store .cse28 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse27))) (let ((.cse24 (select .cse25 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (forall ((v_ArrVal_537 (Array Int Int))) (or (forall ((v_arrayElimCell_41 Int) (v_ArrVal_538 (Array Int Int))) (or (= (select (select (store (store .cse25 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store (store (store .cse26 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse27) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (not (= v_ArrVal_537 (store .cse24 .cse2 (select v_ArrVal_537 .cse2))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0) (or (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse6 .cse7 (select v_ArrVal_537 .cse7)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_537) (select .cse21 .cse7) v_ArrVal_538) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1))) (= 3 |c_ULTIMATE.start_main_#t~mem8#1|)) (or (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_526)))) (let ((.cse32 (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_532))) (let ((.cse31 (store (select .cse32 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) (let ((.cse29 (select (store .cse32 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse31) |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (= 3 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_537 (Array Int Int)) (v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int))) (or (= (select (select (store (store (store .cse30 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse31) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (store .cse29 .cse2 (select v_ArrVal_537 .cse2)) v_ArrVal_537)))))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse35 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_526)))) (let ((.cse37 (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_532))) (let ((.cse36 (store (select .cse37 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) (let ((.cse33 (select (store .cse37 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse36) |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_537 (Array Int Int))) (or (not (= (store .cse33 .cse2 (select v_ArrVal_537 .cse2)) v_ArrVal_537)) (forall ((v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int))) (let ((.cse34 (store (store .cse35 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse36) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537))) (or (forall ((v_arrayElimCell_41 Int)) (= (select (select (store .cse34 v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= (select (select (store .cse34 v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))))))))) (not (= .cse0 0))) .cse23 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_29| Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse40 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_526)))) (let ((.cse42 (store .cse40 |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_532))) (let ((.cse41 (store (select .cse42 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) (let ((.cse39 (store .cse42 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse41))) (let ((.cse38 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (forall ((v_ArrVal_537 (Array Int Int)) (v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int))) (or (= (select (select (store (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_537 (store .cse38 .cse2 (select v_ArrVal_537 .cse2)))) (= (select (select (store (store (store .cse40 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse41) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0))))))) is different from true