./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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/splice-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya --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-29 01:22:18,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:22:18,197 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:22:18,201 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:22:18,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:22:18,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:22:18,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:22:18,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:22:18,226 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:22:18,227 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:22:18,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:22:18,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:22:18,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:22:18,229 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:22:18,230 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:22:18,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:22:18,231 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:22:18,231 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:22:18,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:22:18,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:22:18,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:22:18,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:22:18,234 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:22:18,234 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:22:18,234 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:22:18,235 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:22:18,235 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:22:18,235 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:22:18,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:22:18,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:22:18,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:22:18,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:22:18,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:22:18,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:22:18,237 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:22:18,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:22:18,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:22:18,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:22:18,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:22:18,238 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:22:18,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:22:18,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:22:18,239 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_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/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_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya 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-29 01:22:18,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:22:18,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:22:18,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:22:18,502 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:22:18,503 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:22:18,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-properties/splice-2.i [2023-11-29 01:22:21,375 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:22:21,592 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:22:21,592 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/sv-benchmarks/c/list-properties/splice-2.i [2023-11-29 01:22:21,608 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/data/87cd99f36/56c9c111bc764626b052cc4bc77385fa/FLAG3a1372c3d [2023-11-29 01:22:21,622 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/data/87cd99f36/56c9c111bc764626b052cc4bc77385fa [2023-11-29 01:22:21,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:22:21,626 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:22:21,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:22:21,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:22:21,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:22:21,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:22:21" (1/1) ... [2023-11-29 01:22:21,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e6986c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:22:21, skipping insertion in model container [2023-11-29 01:22:21,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:22:21" (1/1) ... [2023-11-29 01:22:21,678 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:22:21,928 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_9e80a00f-04fe-4341-af9c-715d2838c75c/sv-benchmarks/c/list-properties/splice-2.i[23721,23734] [2023-11-29 01:22:21,932 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:22:21,942 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:22:21,982 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_9e80a00f-04fe-4341-af9c-715d2838c75c/sv-benchmarks/c/list-properties/splice-2.i[23721,23734] [2023-11-29 01:22:21,983 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:22:22,009 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:22:22,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:22:22 WrapperNode [2023-11-29 01:22:22,010 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:22:22,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:22:22,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:22:22,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:22:22,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:22:22" (1/1) ... [2023-11-29 01:22:22,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:22:22" (1/1) ... [2023-11-29 01:22:22,050 INFO L138 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 104 [2023-11-29 01:22:22,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:22:22,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:22:22,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:22:22,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:22:22,061 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:22:22" (1/1) ... [2023-11-29 01:22:22,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:22:22" (1/1) ... [2023-11-29 01:22:22,064 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:22:22" (1/1) ... [2023-11-29 01:22:22,079 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-29 01:22:22,079 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:22:22" (1/1) ... [2023-11-29 01:22:22,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:22:22" (1/1) ... [2023-11-29 01:22:22,087 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:22:22" (1/1) ... [2023-11-29 01:22:22,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:22:22" (1/1) ... [2023-11-29 01:22:22,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:22:22" (1/1) ... [2023-11-29 01:22:22,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:22:22" (1/1) ... [2023-11-29 01:22:22,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:22:22,098 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:22:22,098 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:22:22,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:22:22,099 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:22:22" (1/1) ... [2023-11-29 01:22:22,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:22:22,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:22,148 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:22,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:22:22,201 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-29 01:22:22,201 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-29 01:22:22,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 01:22:22,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 01:22:22,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 01:22:22,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 01:22:22,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 01:22:22,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:22:22,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 01:22:22,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 01:22:22,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 01:22:22,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 01:22:22,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:22:22,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 01:22:22,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:22:22,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:22:22,300 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:22:22,302 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:22:22,328 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-29 01:22:22,454 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:22:22,474 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:22:22,474 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 01:22:22,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:22:22 BoogieIcfgContainer [2023-11-29 01:22:22,475 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:22:22,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:22:22,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:22:22,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:22:22,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:22:21" (1/3) ... [2023-11-29 01:22:22,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d168d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:22:22, skipping insertion in model container [2023-11-29 01:22:22,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:22:22" (2/3) ... [2023-11-29 01:22:22,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d168d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:22:22, skipping insertion in model container [2023-11-29 01:22:22,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:22:22" (3/3) ... [2023-11-29 01:22:22,484 INFO L112 eAbstractionObserver]: Analyzing ICFG splice-2.i [2023-11-29 01:22:22,503 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:22:22,503 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:22:22,545 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:22:22,551 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;@7c5fdb26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:22:22,551 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:22:22,554 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-29 01:22:22,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 01:22:22,560 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:22:22,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:22:22,561 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:22:22,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:22:22,565 INFO L85 PathProgramCache]: Analyzing trace with hash 285317644, now seen corresponding path program 1 times [2023-11-29 01:22:22,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:22:22,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842973188] [2023-11-29 01:22:22,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:22:22,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:22:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:22:22,709 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-29 01:22:22,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:22:22,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842973188] [2023-11-29 01:22:22,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842973188] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:22:22,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:22:22,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:22:22,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157651758] [2023-11-29 01:22:22,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:22:22,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 01:22:22,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:22:22,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 01:22:22,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:22:22,748 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-29 01:22:22,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:22:22,767 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2023-11-29 01:22:22,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 01:22:22,770 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-29 01:22:22,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:22:22,776 INFO L225 Difference]: With dead ends: 45 [2023-11-29 01:22:22,776 INFO L226 Difference]: Without dead ends: 22 [2023-11-29 01:22:22,779 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-29 01:22:22,783 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-29 01:22:22,783 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-29 01:22:22,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-29 01:22:22,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-29 01:22:22,805 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-29 01:22:22,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-11-29 01:22:22,807 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 11 [2023-11-29 01:22:22,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:22:22,807 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-11-29 01:22:22,808 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-29 01:22:22,808 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2023-11-29 01:22:22,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 01:22:22,809 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:22:22,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:22:22,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:22:22,809 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:22:22,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:22:22,810 INFO L85 PathProgramCache]: Analyzing trace with hash -726011293, now seen corresponding path program 1 times [2023-11-29 01:22:22,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:22:22,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793805650] [2023-11-29 01:22:22,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:22:22,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:22:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:22:23,014 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-29 01:22:23,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:22:23,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793805650] [2023-11-29 01:22:23,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793805650] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:22:23,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:22:23,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:22:23,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698767569] [2023-11-29 01:22:23,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:22:23,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:22:23,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:22:23,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:22:23,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:22:23,018 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-29 01:22:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:22:23,081 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2023-11-29 01:22:23,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:22:23,081 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-29 01:22:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:22:23,082 INFO L225 Difference]: With dead ends: 44 [2023-11-29 01:22:23,082 INFO L226 Difference]: Without dead ends: 31 [2023-11-29 01:22:23,083 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-29 01:22:23,084 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.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:22:23,085 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.0s Time] [2023-11-29 01:22:23,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-29 01:22:23,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2023-11-29 01:22:23,090 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-29 01:22:23,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-11-29 01:22:23,091 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 13 [2023-11-29 01:22:23,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:22:23,091 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-11-29 01:22:23,091 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-29 01:22:23,091 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2023-11-29 01:22:23,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 01:22:23,092 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:22:23,092 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-29 01:22:23,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:22:23,093 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:22:23,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:22:23,094 INFO L85 PathProgramCache]: Analyzing trace with hash -489421778, now seen corresponding path program 1 times [2023-11-29 01:22:23,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:22:23,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224192522] [2023-11-29 01:22:23,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:22:23,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:22:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:22:23,227 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-29 01:22:23,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:22:23,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224192522] [2023-11-29 01:22:23,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224192522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:22:23,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:22:23,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:22:23,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878654140] [2023-11-29 01:22:23,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:22:23,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:22:23,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:22:23,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:22:23,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:22:23,231 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-29 01:22:23,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:22:23,293 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2023-11-29 01:22:23,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:22:23,293 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-29 01:22:23,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:22:23,294 INFO L225 Difference]: With dead ends: 34 [2023-11-29 01:22:23,294 INFO L226 Difference]: Without dead ends: 26 [2023-11-29 01:22:23,295 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-29 01:22:23,296 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:22:23,297 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.0s Time] [2023-11-29 01:22:23,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-29 01:22:23,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-29 01:22:23,301 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-29 01:22:23,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-11-29 01:22:23,302 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 19 [2023-11-29 01:22:23,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:22:23,303 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-11-29 01:22:23,303 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-29 01:22:23,303 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-11-29 01:22:23,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 01:22:23,304 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:22:23,304 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-29 01:22:23,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:22:23,305 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:22:23,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:22:23,305 INFO L85 PathProgramCache]: Analyzing trace with hash -612434823, now seen corresponding path program 1 times [2023-11-29 01:22:23,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:22:23,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183873300] [2023-11-29 01:22:23,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:22:23,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:22:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:22:23,414 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-29 01:22:23,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:22:23,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183873300] [2023-11-29 01:22:23,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183873300] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:22:23,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475033294] [2023-11-29 01:22:23,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:22:23,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:22:23,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:23,432 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:22:23,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 01:22:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:22:23,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:22:23,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:22:23,576 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-29 01:22:23,576 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:22:23,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475033294] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:22:23,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:22:23,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-11-29 01:22:23,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835743456] [2023-11-29 01:22:23,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:22:23,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:22:23,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:22:23,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:22:23,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:22:23,579 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-29 01:22:23,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:22:23,598 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2023-11-29 01:22:23,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:22:23,599 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-29 01:22:23,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:22:23,600 INFO L225 Difference]: With dead ends: 66 [2023-11-29 01:22:23,600 INFO L226 Difference]: Without dead ends: 45 [2023-11-29 01:22:23,601 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-29 01:22:23,602 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-29 01:22:23,603 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-29 01:22:23,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-29 01:22:23,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2023-11-29 01:22:23,608 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-29 01:22:23,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2023-11-29 01:22:23,609 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 22 [2023-11-29 01:22:23,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:22:23,610 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2023-11-29 01:22:23,610 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-29 01:22:23,610 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2023-11-29 01:22:23,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 01:22:23,611 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:22:23,611 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-29 01:22:23,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:22:23,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:22:23,817 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:22:23,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:22:23,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1907525111, now seen corresponding path program 1 times [2023-11-29 01:22:23,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:22:23,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393803665] [2023-11-29 01:22:23,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:22:23,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:22:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:22:24,468 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-29 01:22:24,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:22:24,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393803665] [2023-11-29 01:22:24,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393803665] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:22:24,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143764019] [2023-11-29 01:22:24,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:22:24,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:22:24,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:24,472 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:22:24,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 01:22:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:22:24,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-29 01:22:24,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:22:24,617 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-29 01:22:24,720 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-29 01:22:24,771 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:22:24,771 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-29 01:22:24,840 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-29 01:22:24,890 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-29 01:22:24,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 01:22:25,000 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-29 01:22:25,000 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:22:25,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:25,226 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-29 01:22:25,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:25,239 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-29 01:22:25,246 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-29 01:22:25,363 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-29 01:22:25,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143764019] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:22:25,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:22:25,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2023-11-29 01:22:25,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737522787] [2023-11-29 01:22:25,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:22:25,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 01:22:25,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:22:25,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 01:22:25,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=580, Unknown=5, NotChecked=0, Total=702 [2023-11-29 01:22:25,366 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-29 01:22:26,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:22:26,095 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2023-11-29 01:22:26,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 01:22:26,096 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-29 01:22:26,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:22:26,097 INFO L225 Difference]: With dead ends: 56 [2023-11-29 01:22:26,097 INFO L226 Difference]: Without dead ends: 54 [2023-11-29 01:22:26,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=277, Invalid=1049, Unknown=6, NotChecked=0, Total=1332 [2023-11-29 01:22:26,099 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-29 01:22:26,099 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-29 01:22:26,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-29 01:22:26,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2023-11-29 01:22:26,107 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-29 01:22:26,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2023-11-29 01:22:26,108 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 22 [2023-11-29 01:22:26,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:22:26,108 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2023-11-29 01:22:26,108 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-29 01:22:26,108 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2023-11-29 01:22:26,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 01:22:26,109 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:22:26,109 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-29 01:22:26,115 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 01:22:26,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:22:26,310 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:22:26,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:22:26,311 INFO L85 PathProgramCache]: Analyzing trace with hash -821079412, now seen corresponding path program 1 times [2023-11-29 01:22:26,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:22:26,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455390145] [2023-11-29 01:22:26,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:22:26,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:22:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:22:26,394 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-29 01:22:26,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:22:26,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455390145] [2023-11-29 01:22:26,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455390145] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:22:26,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615390460] [2023-11-29 01:22:26,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:22:26,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:22:26,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:26,396 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:22:26,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 01:22:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:22:26,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 01:22:26,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:22:26,536 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-29 01:22:26,536 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:22:26,566 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-29 01:22:26,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615390460] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:22:26,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:22:26,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2023-11-29 01:22:26,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605004243] [2023-11-29 01:22:26,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:22:26,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:22:26,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:22:26,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:22:26,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:22:26,569 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-29 01:22:26,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:22:26,691 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2023-11-29 01:22:26,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:22:26,692 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-29 01:22:26,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:22:26,694 INFO L225 Difference]: With dead ends: 71 [2023-11-29 01:22:26,694 INFO L226 Difference]: Without dead ends: 66 [2023-11-29 01:22:26,695 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-29 01:22:26,695 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-29 01:22:26,696 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-29 01:22:26,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-29 01:22:26,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2023-11-29 01:22:26,706 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-29 01:22:26,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2023-11-29 01:22:26,707 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 24 [2023-11-29 01:22:26,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:22:26,707 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2023-11-29 01:22:26,707 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-29 01:22:26,707 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2023-11-29 01:22:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 01:22:26,708 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:22:26,708 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-29 01:22:26,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 01:22:26,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:22:26,909 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:22:26,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:22:26,909 INFO L85 PathProgramCache]: Analyzing trace with hash -819369390, now seen corresponding path program 1 times [2023-11-29 01:22:26,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:22:26,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475192269] [2023-11-29 01:22:26,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:22:26,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:22:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:22:27,278 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-29 01:22:27,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:22:27,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475192269] [2023-11-29 01:22:27,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475192269] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:22:27,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031331244] [2023-11-29 01:22:27,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:22:27,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:22:27,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:27,280 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:22:27,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 01:22:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:22:27,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 01:22:27,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:22:27,434 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-29 01:22:27,439 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-29 01:22:27,498 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-29 01:22:27,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:22:27,538 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-29 01:22:27,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031331244] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:22:27,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:22:27,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2023-11-29 01:22:27,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844257620] [2023-11-29 01:22:27,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:22:27,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 01:22:27,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:22:27,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 01:22:27,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:22:27,541 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-29 01:22:27,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:22:27,737 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2023-11-29 01:22:27,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:22:27,738 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-29 01:22:27,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:22:27,738 INFO L225 Difference]: With dead ends: 63 [2023-11-29 01:22:27,738 INFO L226 Difference]: Without dead ends: 56 [2023-11-29 01:22:27,739 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-29 01:22:27,740 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-29 01:22:27,740 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-29 01:22:27,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-29 01:22:27,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2023-11-29 01:22:27,749 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-29 01:22:27,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2023-11-29 01:22:27,750 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 24 [2023-11-29 01:22:27,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:22:27,750 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2023-11-29 01:22:27,750 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-29 01:22:27,750 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2023-11-29 01:22:27,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 01:22:27,751 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:22:27,751 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-29 01:22:27,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 01:22:27,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-29 01:22:27,955 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:22:27,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:22:27,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1293927920, now seen corresponding path program 1 times [2023-11-29 01:22:27,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:22:27,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051900004] [2023-11-29 01:22:27,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:22:27,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:22:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:22:28,575 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-29 01:22:28,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:22:28,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051900004] [2023-11-29 01:22:28,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051900004] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:22:28,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411963150] [2023-11-29 01:22:28,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:22:28,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:22:28,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:28,577 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:22:28,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 01:22:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:22:28,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-29 01:22:28,680 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:22:28,686 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-29 01:22:28,775 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:22:28,776 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-29 01:22:28,828 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-29 01:22:28,836 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-29 01:22:28,912 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:22:28,912 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-29 01:22:28,918 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-29 01:22:28,921 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-29 01:22:29,000 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-29 01:22:29,005 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-29 01:22:29,043 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-29 01:22:29,094 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-29 01:22:29,122 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-29 01:22:29,122 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:22:29,175 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-29 01:22:29,252 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-29 01:22:29,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:29,264 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-29 01:22:29,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:29,274 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-29 01:22:29,280 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-29 01:22:29,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:29,406 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-29 01:22:29,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:29,414 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-29 01:22:29,418 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-29 01:22:29,435 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-29 01:22:29,435 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-29 01:22:29,440 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-29 01:22:29,440 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-29 01:22:29,592 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-29 01:22:29,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411963150] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:22:29,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:22:29,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 32 [2023-11-29 01:22:29,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221154864] [2023-11-29 01:22:29,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:22:29,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 01:22:29,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:22:29,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 01:22:29,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=8, NotChecked=118, Total=1056 [2023-11-29 01:22:29,595 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-29 01:22:30,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:22:30,662 INFO L93 Difference]: Finished difference Result 113 states and 139 transitions. [2023-11-29 01:22:30,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 01:22:30,663 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-29 01:22:30,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:22:30,664 INFO L225 Difference]: With dead ends: 113 [2023-11-29 01:22:30,664 INFO L226 Difference]: Without dead ends: 94 [2023-11-29 01:22:30,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=291, Invalid=2258, Unknown=9, NotChecked=198, Total=2756 [2023-11-29 01:22:30,666 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 206 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:22:30,667 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.4s Time] [2023-11-29 01:22:30,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-29 01:22:30,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 60. [2023-11-29 01:22:30,679 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-29 01:22:30,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2023-11-29 01:22:30,680 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 25 [2023-11-29 01:22:30,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:22:30,680 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2023-11-29 01:22:30,680 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-29 01:22:30,681 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2023-11-29 01:22:30,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 01:22:30,682 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:22:30,682 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-29 01:22:30,687 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 01:22:30,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:22:30,883 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:22:30,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:22:30,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1436644313, now seen corresponding path program 1 times [2023-11-29 01:22:30,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:22:30,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561950218] [2023-11-29 01:22:30,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:22:30,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:22:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:22:30,932 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-29 01:22:30,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:22:30,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561950218] [2023-11-29 01:22:30,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561950218] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:22:30,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:22:30,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:22:30,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360844508] [2023-11-29 01:22:30,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:22:30,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:22:30,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:22:30,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:22:30,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:22:30,934 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-29 01:22:30,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:22:30,975 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2023-11-29 01:22:30,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:22:30,975 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-29 01:22:30,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:22:30,976 INFO L225 Difference]: With dead ends: 74 [2023-11-29 01:22:30,976 INFO L226 Difference]: Without dead ends: 57 [2023-11-29 01:22:30,976 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-29 01:22:30,977 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-29 01:22:30,977 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-29 01:22:30,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-29 01:22:30,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2023-11-29 01:22:30,986 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-29 01:22:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2023-11-29 01:22:30,987 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 26 [2023-11-29 01:22:30,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:22:30,987 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2023-11-29 01:22:30,987 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-29 01:22:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2023-11-29 01:22:30,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 01:22:30,988 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:22:30,989 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-29 01:22:30,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 01:22:30,989 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:22:30,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:22:30,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1062138715, now seen corresponding path program 2 times [2023-11-29 01:22:30,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:22:30,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723460572] [2023-11-29 01:22:30,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:22:30,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:22:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:22:31,017 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-29 01:22:31,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:22:31,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723460572] [2023-11-29 01:22:31,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723460572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:22:31,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:22:31,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:22:31,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562870117] [2023-11-29 01:22:31,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:22:31,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:22:31,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:22:31,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:22:31,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:22:31,019 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-29 01:22:31,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:22:31,036 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2023-11-29 01:22:31,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:22:31,036 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-29 01:22:31,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:22:31,037 INFO L225 Difference]: With dead ends: 103 [2023-11-29 01:22:31,037 INFO L226 Difference]: Without dead ends: 59 [2023-11-29 01:22:31,037 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-29 01:22:31,038 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-29 01:22:31,038 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-29 01:22:31,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-29 01:22:31,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2023-11-29 01:22:31,045 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-29 01:22:31,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2023-11-29 01:22:31,046 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 31 [2023-11-29 01:22:31,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:22:31,046 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2023-11-29 01:22:31,046 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-29 01:22:31,047 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2023-11-29 01:22:31,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 01:22:31,047 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:22:31,048 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-29 01:22:31,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 01:22:31,048 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:22:31,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:22:31,049 INFO L85 PathProgramCache]: Analyzing trace with hash 244490265, now seen corresponding path program 1 times [2023-11-29 01:22:31,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:22:31,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677074587] [2023-11-29 01:22:31,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:22:31,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:22:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:22:31,808 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-29 01:22:31,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:22:31,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677074587] [2023-11-29 01:22:31,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677074587] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:22:31,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416252013] [2023-11-29 01:22:31,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:22:31,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:22:31,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:31,810 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:22:31,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 01:22:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:22:31,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-29 01:22:31,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:22:31,943 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-29 01:22:32,015 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-29 01:22:32,060 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:22:32,060 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-29 01:22:32,082 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-29 01:22:32,089 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-29 01:22:32,152 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 01:22:32,152 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-29 01:22:32,172 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 01:22:32,173 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-29 01:22:32,247 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:22:32,247 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-29 01:22:32,252 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-29 01:22:32,332 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 01:22:32,333 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-29 01:22:32,367 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 01:22:32,367 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-29 01:22:32,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 01:22:32,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-29 01:22:32,639 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 01:22:32,640 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-29 01:22:32,761 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-29 01:22:32,761 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-29 01:22:32,826 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-29 01:22:32,827 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:22:32,838 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-29 01:22:32,904 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-29 01:22:32,915 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-29 01:22:32,929 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-29 01:22:32,942 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-29 01:22:32,971 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-29 01:22:33,024 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-29 01:22:33,061 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-29 01:22:33,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:33,124 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-29 01:22:33,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:33,149 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-29 01:22:33,163 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-29 01:22:33,172 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-29 01:22:34,402 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-29 01:22:39,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:39,870 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-29 01:22:39,875 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:22:39,939 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2023-11-29 01:22:39,940 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-29 01:22:39,996 INFO L349 Elim1Store]: treesize reduction 26, result has 58.7 percent of original size [2023-11-29 01:22:39,996 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-29 01:22:40,013 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:22:40,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:40,037 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-29 01:22:40,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-11-29 01:22:40,208 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-29 01:22:40,230 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:22:40,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:40,288 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-29 01:22:40,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:40,326 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-29 01:22:40,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 01:22:40,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:40,582 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-29 01:22:40,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:40,640 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-29 01:22:40,719 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2023-11-29 01:22:40,719 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-29 01:22:40,788 INFO L349 Elim1Store]: treesize reduction 37, result has 54.3 percent of original size [2023-11-29 01:22:40,789 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-29 01:22:40,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:40,884 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-29 01:22:40,947 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-29 01:22:41,170 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-29 01:22:41,239 INFO L349 Elim1Store]: treesize reduction 17, result has 37.0 percent of original size [2023-11-29 01:22:41,239 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-29 01:22:41,315 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 01:22:41,362 INFO L349 Elim1Store]: treesize reduction 17, result has 37.0 percent of original size [2023-11-29 01:22:41,363 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-29 01:22:41,601 INFO L349 Elim1Store]: treesize reduction 17, result has 37.0 percent of original size [2023-11-29 01:22:41,601 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-29 01:22:41,668 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-29 01:22:41,800 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-29 01:22:41,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:41,837 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-29 01:22:41,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:41,944 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-29 01:22:41,966 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 01:22:41,966 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-29 01:22:41,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:41,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 209 treesize of output 123 [2023-11-29 01:22:42,002 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:22:42,004 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:22:42,009 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-29 01:22:42,016 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-29 01:22:42,025 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-29 01:22:42,041 INFO L349 Elim1Store]: treesize reduction 13, result has 31.6 percent of original size [2023-11-29 01:22:42,042 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-29 01:22:42,102 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-29 01:22:42,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:42,116 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-29 01:22:42,121 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:22:42,122 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:22:42,126 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-29 01:22:42,136 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-29 01:22:42,151 INFO L349 Elim1Store]: treesize reduction 13, result has 31.6 percent of original size [2023-11-29 01:22:42,151 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-29 01:22:42,181 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-29 01:22:42,192 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-29 01:22:42,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:42,206 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-29 01:22:42,211 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:22:42,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:42,231 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-29 01:22:42,288 INFO L349 Elim1Store]: treesize reduction 26, result has 58.7 percent of original size [2023-11-29 01:22:42,289 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-29 01:22:42,319 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-29 01:22:42,364 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-29 01:22:42,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:42,447 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-29 01:22:42,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:42,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2023-11-29 01:22:42,600 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-29 01:22:42,614 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-29 01:22:42,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:42,625 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-29 01:22:42,630 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:22:42,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:42,645 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-29 01:22:42,695 INFO L349 Elim1Store]: treesize reduction 26, result has 58.7 percent of original size [2023-11-29 01:22:42,695 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-29 01:22:42,713 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-29 01:22:42,731 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-29 01:22:42,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:42,800 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-29 01:22:42,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:42,853 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-29 01:22:42,927 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-29 01:22:42,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:42,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2023-11-29 01:22:42,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:42,976 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-29 01:22:42,979 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:22:42,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:42,985 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-29 01:22:42,992 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-29 01:22:42,999 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-29 01:22:43,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:43,007 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-29 01:22:43,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:43,037 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-29 01:22:43,042 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:22:43,043 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:22:43,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:43,052 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-29 01:22:43,063 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-29 01:22:43,080 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-29 01:22:43,131 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-29 01:22:43,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:43,143 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-29 01:22:43,148 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:22:43,149 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:22:43,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:43,158 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-29 01:22:43,166 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-29 01:22:43,180 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-29 01:22:43,211 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-29 01:22:43,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:43,225 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-29 01:22:43,230 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:22:43,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:43,265 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-29 01:22:43,317 INFO L349 Elim1Store]: treesize reduction 26, result has 58.7 percent of original size [2023-11-29 01:22:43,318 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-29 01:22:43,336 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-29 01:22:43,390 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-29 01:22:43,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:43,461 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-29 01:22:43,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:43,504 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-29 01:22:43,606 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-29 01:22:43,624 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-29 01:22:43,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:43,638 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-29 01:22:43,642 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:22:43,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:43,664 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-29 01:22:43,705 INFO L349 Elim1Store]: treesize reduction 26, result has 58.7 percent of original size [2023-11-29 01:22:43,705 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-29 01:22:43,722 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-29 01:22:43,778 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-29 01:22:43,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:43,823 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-29 01:22:43,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:43,873 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-29 01:22:43,966 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-29 01:22:43,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:43,988 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-29 01:22:44,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:44,012 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-29 01:22:44,016 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:22:44,017 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:22:44,051 INFO L349 Elim1Store]: treesize reduction 21, result has 62.5 percent of original size [2023-11-29 01:22:44,052 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-29 01:22:44,060 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:22:44,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:44,074 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-29 01:22:44,097 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-29 01:22:44,141 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-29 01:22:44,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:44,197 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-29 01:22:44,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:44,217 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-29 01:22:44,220 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:22:44,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:44,227 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-29 01:22:44,232 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-29 01:22:44,240 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-29 01:22:44,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:44,256 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-29 01:22:44,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:44,275 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-29 01:22:44,279 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:22:44,279 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:22:44,310 INFO L349 Elim1Store]: treesize reduction 21, result has 62.5 percent of original size [2023-11-29 01:22:44,310 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-29 01:22:44,317 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:22:44,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:44,330 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-29 01:22:44,362 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-29 01:22:44,370 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-29 01:22:44,398 INFO L349 Elim1Store]: treesize reduction 36, result has 35.7 percent of original size [2023-11-29 01:22:44,398 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-29 01:22:44,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:44,464 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-29 01:22:53,848 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-29 01:22:53,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416252013] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:22:53,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:22:53,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 44 [2023-11-29 01:22:53,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408046774] [2023-11-29 01:22:53,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:22:53,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-29 01:22:53,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:22:53,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-29 01:22:53,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1125, Unknown=25, NotChecked=684, Total=1980 [2023-11-29 01:22:53,852 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-29 01:23:04,396 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.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))) (let ((.cse20 (select .cse6 0))) (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)))))) (= |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) (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))) (= (select .cse6 |c_ULTIMATE.start_main_~p~0#1.offset|) 3)) (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 (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 [2023-11-29 01:23:19,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:23:19,129 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2023-11-29 01:23:19,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 01:23:19,130 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 31 [2023-11-29 01:23:19,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:23:19,131 INFO L225 Difference]: With dead ends: 106 [2023-11-29 01:23:19,131 INFO L226 Difference]: Without dead ends: 104 [2023-11-29 01:23:19,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 10 IntricatePredicates, 2 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 33.0s TimeCoverageRelationStatistics Valid=294, Invalid=2370, Unknown=28, NotChecked=1090, Total=3782 [2023-11-29 01:23:19,133 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 185 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 956 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:23:19,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 390 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 689 Invalid, 0 Unknown, 956 Unchecked, 6.4s Time] [2023-11-29 01:23:19,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-29 01:23:19,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 68. [2023-11-29 01:23:19,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 67 states have internal predecessors, (77), 0 states have call successors, (0), 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-29 01:23:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2023-11-29 01:23:19,148 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 31 [2023-11-29 01:23:19,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:23:19,148 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2023-11-29 01:23:19,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-29 01:23:19,148 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2023-11-29 01:23:19,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 01:23:19,149 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:23:19,149 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, 1, 1] [2023-11-29 01:23:19,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 01:23:19,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:23:19,350 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:23:19,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:23:19,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1268022284, now seen corresponding path program 1 times [2023-11-29 01:23:19,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:23:19,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53532415] [2023-11-29 01:23:19,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:23:19,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:23:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:23:20,410 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:23:20,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:23:20,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53532415] [2023-11-29 01:23:20,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53532415] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:23:20,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662578930] [2023-11-29 01:23:20,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:23:20,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:23:20,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:23:20,412 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:23:20,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 01:23:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:23:20,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-29 01:23:20,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:23:20,616 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-29 01:23:20,621 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-29 01:23:20,711 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-29 01:23:20,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2023-11-29 01:23:20,733 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-29 01:23:20,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2023-11-29 01:23:20,928 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 01:23:20,929 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:23:21,297 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 01:23:21,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662578930] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:23:21,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:23:21,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 7] total 24 [2023-11-29 01:23:21,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321713720] [2023-11-29 01:23:21,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:23:21,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 01:23:21,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:23:21,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 01:23:21,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2023-11-29 01:23:21,300 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 24 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 0 states have call successors, (0), 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-29 01:23:22,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:23:22,219 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2023-11-29 01:23:22,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-29 01:23:22,220 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-11-29 01:23:22,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:23:22,221 INFO L225 Difference]: With dead ends: 96 [2023-11-29 01:23:22,221 INFO L226 Difference]: Without dead ends: 89 [2023-11-29 01:23:22,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=162, Invalid=1170, Unknown=0, NotChecked=0, Total=1332 [2023-11-29 01:23:22,222 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 43 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:23:22,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 205 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:23:22,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-29 01:23:22,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 70. [2023-11-29 01:23:22,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 69 states have internal predecessors, (80), 0 states have call successors, (0), 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-29 01:23:22,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2023-11-29 01:23:22,233 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 33 [2023-11-29 01:23:22,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:23:22,233 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2023-11-29 01:23:22,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 0 states have call successors, (0), 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-29 01:23:22,233 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2023-11-29 01:23:22,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 01:23:22,234 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:23:22,234 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:23:22,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 01:23:22,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:23:22,435 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:23:22,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:23:22,435 INFO L85 PathProgramCache]: Analyzing trace with hash 202694188, now seen corresponding path program 2 times [2023-11-29 01:23:22,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:23:22,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182310439] [2023-11-29 01:23:22,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:23:22,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:23:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:23:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:23:23,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:23:23,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182310439] [2023-11-29 01:23:23,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182310439] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:23:23,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078670362] [2023-11-29 01:23:23,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:23:23,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:23:23,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:23:23,632 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:23:23,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 01:23:23,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:23:23,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:23:23,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 74 conjunts are in the unsatisfiable core [2023-11-29 01:23:23,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:23:23,763 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-29 01:23:23,861 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 01:23:23,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 01:23:23,935 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-29 01:23:23,947 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-29 01:23:24,051 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 01:23:24,051 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-29 01:23:24,055 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-29 01:23:24,078 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 01:23:24,078 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 33 treesize of output 24 [2023-11-29 01:23:24,130 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-29 01:23:24,131 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 20 treesize of output 22 [2023-11-29 01:23:24,221 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2023-11-29 01:23:24,221 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 147 treesize of output 109 [2023-11-29 01:23:24,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 82 [2023-11-29 01:23:24,356 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-11-29 01:23:24,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 177 treesize of output 140 [2023-11-29 01:23:24,380 INFO L349 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2023-11-29 01:23:24,381 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 129 [2023-11-29 01:23:24,395 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2023-11-29 01:23:24,668 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-29 01:23:24,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 66 [2023-11-29 01:23:24,674 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 64 treesize of output 52 [2023-11-29 01:23:24,679 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 0 case distinctions, treesize of input 60 treesize of output 47 [2023-11-29 01:23:24,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2023-11-29 01:23:24,709 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2023-11-29 01:23:24,709 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 2 case distinctions, treesize of input 30 treesize of output 33 [2023-11-29 01:23:24,728 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 33 treesize of output 15 [2023-11-29 01:23:24,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:23:24,742 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-29 01:23:24,751 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-29 01:23:24,753 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:23:24,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:23:24,820 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_765) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 3)) is different from false [2023-11-29 01:23:24,903 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_764 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= 3 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_765) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_763) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_764) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))))) is different from false [2023-11-29 01:23:24,912 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_764 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (let ((.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2) 4))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_762) .cse0 v_ArrVal_765) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_763) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_764) .cse0) .cse1)))) 3)) is different from false [2023-11-29 01:23:25,060 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2023-11-29 01:23:25,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 119 [2023-11-29 01:23:25,118 INFO L349 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2023-11-29 01:23:25,119 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 903 treesize of output 909 [2023-11-29 01:23:25,139 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 152 treesize of output 120 [2023-11-29 01:23:25,147 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 183 treesize of output 119 [2023-11-29 01:23:28,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:28,790 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2023-11-29 01:23:28,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:28,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2023-11-29 01:23:28,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:28,820 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 126 [2023-11-29 01:23:28,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:28,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 106 [2023-11-29 01:23:28,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:28,861 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2023-11-29 01:23:28,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:28,870 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2023-11-29 01:23:28,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:28,889 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 116 [2023-11-29 01:23:28,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:28,899 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 134 [2023-11-29 01:23:28,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:28,924 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 103 [2023-11-29 01:23:28,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:28,933 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 93 [2023-11-29 01:23:28,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:28,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 126 [2023-11-29 01:23:28,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:28,968 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 106 [2023-11-29 01:23:28,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:28,997 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 109 [2023-11-29 01:23:29,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:29,006 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 118 [2023-11-29 01:23:29,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:29,035 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 108 [2023-11-29 01:23:29,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:29,045 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 93 [2023-11-29 01:23:29,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:29,073 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2023-11-29 01:23:29,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:29,082 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2023-11-29 01:23:29,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:29,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2023-11-29 01:23:29,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:29,115 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2023-11-29 01:23:29,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:29,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 109 [2023-11-29 01:23:29,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:29,151 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 118 [2023-11-29 01:23:29,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:29,184 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 108 [2023-11-29 01:23:29,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:29,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 93 [2023-11-29 01:23:29,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:29,227 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 103 [2023-11-29 01:23:29,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:29,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 93 [2023-11-29 01:23:29,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:29,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 116 [2023-11-29 01:23:29,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:29,277 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 134 [2023-11-29 01:23:36,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:36,454 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 196 treesize of output 176 [2023-11-29 01:23:36,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:36,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 6301 treesize of output 5046 [2023-11-29 01:23:36,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:36,621 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 1442 treesize of output 1052 [2023-11-29 01:23:36,633 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:23:36,953 INFO L349 Elim1Store]: treesize reduction 42, result has 82.1 percent of original size [2023-11-29 01:23:36,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 8574 treesize of output 5983 [2023-11-29 01:23:37,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:37,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 960 treesize of output 916 [2023-11-29 01:23:37,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:37,312 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 378 treesize of output 379 [2023-11-29 01:23:37,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:37,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 963 treesize of output 751 [2023-11-29 01:23:37,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:37,517 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 230 treesize of output 223 [2023-11-29 01:23:37,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:37,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 222 treesize of output 214 [2023-11-29 01:23:37,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:37,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 292 treesize of output 296 [2023-11-29 01:23:47,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:47,967 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 169 treesize of output 139 [2023-11-29 01:23:48,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:48,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 50190 treesize of output 37861 [2023-11-29 01:23:48,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:48,201 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 2367 treesize of output 1757 [2023-11-29 01:23:48,233 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:23:48,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:48,256 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 2319 treesize of output 1952 [2023-11-29 01:23:48,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:48,353 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 986 treesize of output 722 [2023-11-29 01:23:48,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:48,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 623 treesize of output 603 [2023-11-29 01:23:48,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:48,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 613 treesize of output 595 [2023-11-29 01:23:48,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:48,616 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 427 treesize of output 403 [2023-11-29 01:23:58,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:58,229 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 88 treesize of output 79 [2023-11-29 01:23:58,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:58,236 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 68 treesize of output 69 [2023-11-29 01:23:58,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:58,251 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 371 treesize of output 262 [2023-11-29 01:23:58,257 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:23:58,478 INFO L349 Elim1Store]: treesize reduction 38, result has 82.6 percent of original size [2023-11-29 01:23:58,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 4748 treesize of output 3973 [2023-11-29 01:23:58,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:58,568 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 351 treesize of output 303 [2023-11-29 01:23:58,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:58,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 491 treesize of output 363 [2023-11-29 01:23:58,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:58,661 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 246 treesize of output 222 [2023-11-29 01:23:58,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:23:58,689 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 214 treesize of output 206 [2023-11-29 01:24:02,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:24:02,509 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 169 treesize of output 149 [2023-11-29 01:24:02,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:24:02,518 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 139 treesize of output 119 [2023-11-29 01:24:02,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:24:02,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 5208 treesize of output 3807 [2023-11-29 01:24:02,651 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:24:03,013 INFO L349 Elim1Store]: treesize reduction 42, result has 82.1 percent of original size [2023-11-29 01:24:03,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 9389 treesize of output 7478 [2023-11-29 01:24:03,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:24:03,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1050 treesize of output 842 [2023-11-29 01:24:03,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:24:03,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 636 treesize of output 584 [2023-11-29 01:24:03,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:24:03,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 308 treesize of output 312 [2023-11-29 01:24:03,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:24:03,525 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 214 treesize of output 206 [2023-11-29 01:24:03,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:24:03,590 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 222 treesize of output 222 [2023-11-29 01:24:03,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:24:03,655 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 214 treesize of output 206 [2023-11-29 01:24:19,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:24:19,132 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 196 treesize of output 156 [2023-11-29 01:24:19,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:24:19,141 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 146 treesize of output 136 [2023-11-29 01:24:19,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:24:19,156 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 711 treesize of output 524 [2023-11-29 01:24:19,165 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:24:19,442 INFO L349 Elim1Store]: treesize reduction 38, result has 82.6 percent of original size [2023-11-29 01:24:19,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 11510 treesize of output 9399 [2023-11-29 01:24:19,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:24:19,682 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 793 treesize of output 717 [2023-11-29 01:24:19,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:24:19,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 897 treesize of output 625 [2023-11-29 01:24:19,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:24:19,813 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 508 treesize of output 484 [2023-11-29 01:24:19,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:24:19,854 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 476 treesize of output 420 [2023-11-29 01:24:23,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:24:23,099 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 169 treesize of output 139 [2023-11-29 01:24:23,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:24:23,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 47449 treesize of output 36974 [2023-11-29 01:24:23,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:24:23,375 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 4495 treesize of output 3325 [2023-11-29 01:24:23,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:24:23,451 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 20487 treesize of output 19076 [2023-11-29 01:24:23,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:24:23,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 1859 treesize of output 1853 [2023-11-29 01:24:23,997 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 1989 treesize of output 1717 [2023-11-29 01:24:24,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:24:24,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1539 treesize of output 1423 [2023-11-29 01:24:24,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:24:24,254 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 1547 treesize of output 1207 [2023-11-29 01:24:24,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:24:24,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 875 treesize of output 835 [2023-11-29 01:29:14,590 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-11-29 01:29:14,591 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-29 01:29:14,592 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 01:29:14,596 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 01:29:14,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 01:29:14,793 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2023-11-29 01:29:14,796 INFO L158 Benchmark]: Toolchain (without parser) took 413170.43ms. Allocated memory was 163.6MB in the beginning and 343.9MB in the end (delta: 180.4MB). Free memory was 126.7MB in the beginning and 156.7MB in the end (delta: -30.1MB). Peak memory consumption was 213.3MB. Max. memory is 16.1GB. [2023-11-29 01:29:14,796 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:29:14,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.15ms. Allocated memory is still 163.6MB. Free memory was 126.7MB in the beginning and 109.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 01:29:14,796 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.14ms. Allocated memory is still 163.6MB. Free memory was 109.9MB in the beginning and 107.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:29:14,796 INFO L158 Benchmark]: Boogie Preprocessor took 45.76ms. Allocated memory is still 163.6MB. Free memory was 107.8MB in the beginning and 104.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:29:14,796 INFO L158 Benchmark]: RCFGBuilder took 377.17ms. Allocated memory is still 163.6MB. Free memory was 104.7MB in the beginning and 121.9MB in the end (delta: -17.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 01:29:14,797 INFO L158 Benchmark]: TraceAbstraction took 412317.75ms. Allocated memory was 163.6MB in the beginning and 343.9MB in the end (delta: 180.4MB). Free memory was 121.1MB in the beginning and 156.7MB in the end (delta: -35.7MB). Peak memory consumption was 209.6MB. Max. memory is 16.1GB. [2023-11-29 01:29:14,798 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.15ms. Allocated memory is still 163.6MB. Free memory was 126.7MB in the beginning and 109.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.14ms. Allocated memory is still 163.6MB. Free memory was 109.9MB in the beginning and 107.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.76ms. Allocated memory is still 163.6MB. Free memory was 107.8MB in the beginning and 104.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 377.17ms. Allocated memory is still 163.6MB. Free memory was 104.7MB in the beginning and 121.9MB in the end (delta: -17.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 412317.75ms. Allocated memory was 163.6MB in the beginning and 343.9MB in the end (delta: 180.4MB). Free memory was 121.1MB in the beginning and 156.7MB in the end (delta: -35.7MB). Peak memory consumption was 209.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/splice-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya --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-29 01:29:16,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:29:16,523 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 01:29:16,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:29:16,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:29:16,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:29:16,559 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:29:16,559 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:29:16,560 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:29:16,560 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:29:16,561 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:29:16,561 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:29:16,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:29:16,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:29:16,564 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:29:16,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:29:16,565 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:29:16,565 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:29:16,566 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:29:16,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:29:16,567 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:29:16,567 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:29:16,567 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:29:16,568 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:29:16,568 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 01:29:16,568 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 01:29:16,569 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:29:16,569 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:29:16,569 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:29:16,570 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:29:16,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:29:16,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:29:16,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:29:16,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:29:16,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:29:16,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:29:16,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:29:16,572 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 01:29:16,572 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 01:29:16,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:29:16,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:29:16,573 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:29:16,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:29:16,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:29:16,574 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 01:29:16,574 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_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/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_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya 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-29 01:29:16,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:29:16,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:29:16,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:29:16,890 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:29:16,890 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:29:16,892 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-properties/splice-2.i [2023-11-29 01:29:19,732 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:29:19,966 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:29:19,967 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/sv-benchmarks/c/list-properties/splice-2.i [2023-11-29 01:29:19,982 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/data/cb62e248c/377e857c6f914eec9c17cedfb318d687/FLAG68ffaf030 [2023-11-29 01:29:19,994 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/data/cb62e248c/377e857c6f914eec9c17cedfb318d687 [2023-11-29 01:29:19,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:29:19,998 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:29:19,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:29:20,000 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:29:20,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:29:20,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:29:19" (1/1) ... [2023-11-29 01:29:20,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@158d8b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:20, skipping insertion in model container [2023-11-29 01:29:20,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:29:19" (1/1) ... [2023-11-29 01:29:20,048 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:29:20,322 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_9e80a00f-04fe-4341-af9c-715d2838c75c/sv-benchmarks/c/list-properties/splice-2.i[23721,23734] [2023-11-29 01:29:20,326 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:29:20,340 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:29:20,394 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_9e80a00f-04fe-4341-af9c-715d2838c75c/sv-benchmarks/c/list-properties/splice-2.i[23721,23734] [2023-11-29 01:29:20,395 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:29:20,440 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:29:20,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:20 WrapperNode [2023-11-29 01:29:20,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:29:20,442 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:29:20,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:29:20,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:29:20,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:20" (1/1) ... [2023-11-29 01:29:20,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:20" (1/1) ... [2023-11-29 01:29:20,489 INFO L138 Inliner]: procedures = 127, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 104 [2023-11-29 01:29:20,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:29:20,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:29:20,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:29:20,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:29:20,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:20" (1/1) ... [2023-11-29 01:29:20,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:20" (1/1) ... [2023-11-29 01:29:20,507 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:20" (1/1) ... [2023-11-29 01:29:20,524 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-29 01:29:20,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:20" (1/1) ... [2023-11-29 01:29:20,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:20" (1/1) ... [2023-11-29 01:29:20,534 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:20" (1/1) ... [2023-11-29 01:29:20,538 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:20" (1/1) ... [2023-11-29 01:29:20,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:20" (1/1) ... [2023-11-29 01:29:20,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:20" (1/1) ... [2023-11-29 01:29:20,548 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:29:20,549 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:29:20,549 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:29:20,549 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:29:20,550 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:20" (1/1) ... [2023-11-29 01:29:20,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:29:20,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:29:20,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:29:20,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:29:20,623 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-29 01:29:20,623 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-29 01:29:20,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 01:29:20,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 01:29:20,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 01:29:20,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:29:20,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 01:29:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 01:29:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 01:29:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 01:29:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 01:29:20,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 01:29:20,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 01:29:20,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 01:29:20,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:29:20,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:29:20,743 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:29:20,746 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:29:20,773 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-29 01:29:20,967 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:29:20,989 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:29:20,989 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 01:29:20,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:29:20 BoogieIcfgContainer [2023-11-29 01:29:20,990 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:29:20,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:29:20,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:29:20,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:29:20,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:29:19" (1/3) ... [2023-11-29 01:29:20,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76822da2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:29:20, skipping insertion in model container [2023-11-29 01:29:20,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:20" (2/3) ... [2023-11-29 01:29:20,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76822da2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:29:20, skipping insertion in model container [2023-11-29 01:29:20,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:29:20" (3/3) ... [2023-11-29 01:29:20,998 INFO L112 eAbstractionObserver]: Analyzing ICFG splice-2.i [2023-11-29 01:29:21,017 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:29:21,017 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:29:21,075 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:29:21,081 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;@5859bd23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:29:21,081 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:29:21,084 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-29 01:29:21,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 01:29:21,090 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:29:21,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:29:21,091 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:29:21,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:29:21,097 INFO L85 PathProgramCache]: Analyzing trace with hash 285317644, now seen corresponding path program 1 times [2023-11-29 01:29:21,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:29:21,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015967511] [2023-11-29 01:29:21,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:29:21,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:21,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:29:21,108 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:29:21,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 01:29:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:29:21,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 01:29:21,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:29:21,243 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-29 01:29:21,244 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:29:21,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:29:21,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2015967511] [2023-11-29 01:29:21,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2015967511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:29:21,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:29:21,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:29:21,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330253969] [2023-11-29 01:29:21,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:29:21,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 01:29:21,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:29:21,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 01:29:21,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:29:21,274 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-29 01:29:21,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:29:21,296 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2023-11-29 01:29:21,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 01:29:21,298 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-29 01:29:21,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:29:21,305 INFO L225 Difference]: With dead ends: 45 [2023-11-29 01:29:21,305 INFO L226 Difference]: Without dead ends: 22 [2023-11-29 01:29:21,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-29 01:29:21,311 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-29 01:29:21,313 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-29 01:29:21,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-29 01:29:21,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-29 01:29:21,340 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-29 01:29:21,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-11-29 01:29:21,342 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 11 [2023-11-29 01:29:21,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:29:21,343 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-11-29 01:29:21,343 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-29 01:29:21,343 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2023-11-29 01:29:21,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 01:29:21,344 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:29:21,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:29:21,348 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:29:21,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:21,545 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:29:21,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:29:21,546 INFO L85 PathProgramCache]: Analyzing trace with hash -726011293, now seen corresponding path program 1 times [2023-11-29 01:29:21,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:29:21,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744937048] [2023-11-29 01:29:21,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:29:21,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:21,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:29:21,548 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:29:21,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 01:29:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:29:21,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:29:21,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:29:21,701 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-29 01:29:21,701 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:29:21,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:29:21,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744937048] [2023-11-29 01:29:21,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744937048] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:29:21,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:29:21,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:29:21,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152684098] [2023-11-29 01:29:21,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:29:21,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:29:21,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:29:21,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:29:21,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:29:21,706 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-29 01:29:21,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:29:21,837 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2023-11-29 01:29:21,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:29:21,838 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-29 01:29:21,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:29:21,839 INFO L225 Difference]: With dead ends: 44 [2023-11-29 01:29:21,839 INFO L226 Difference]: Without dead ends: 31 [2023-11-29 01:29:21,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-29 01:29:21,841 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-29 01:29:21,841 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-29 01:29:21,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-29 01:29:21,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2023-11-29 01:29:21,847 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-29 01:29:21,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-11-29 01:29:21,848 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 13 [2023-11-29 01:29:21,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:29:21,848 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-11-29 01:29:21,849 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-29 01:29:21,849 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2023-11-29 01:29:21,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 01:29:21,850 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:29:21,850 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-29 01:29:21,853 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 01:29:22,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:22,053 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:29:22,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:29:22,054 INFO L85 PathProgramCache]: Analyzing trace with hash -489421778, now seen corresponding path program 1 times [2023-11-29 01:29:22,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:29:22,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734514652] [2023-11-29 01:29:22,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:29:22,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:22,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:29:22,056 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:29:22,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 01:29:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:29:22,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:29:22,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:29:22,221 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-29 01:29:22,232 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-29 01:29:22,232 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:29:22,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:29:22,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734514652] [2023-11-29 01:29:22,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734514652] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:29:22,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:29:22,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:29:22,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411663449] [2023-11-29 01:29:22,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:29:22,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:29:22,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:29:22,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:29:22,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:29:22,236 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-29 01:29:22,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:29:22,375 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2023-11-29 01:29:22,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:29:22,376 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-29 01:29:22,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:29:22,376 INFO L225 Difference]: With dead ends: 34 [2023-11-29 01:29:22,377 INFO L226 Difference]: Without dead ends: 26 [2023-11-29 01:29:22,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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-29 01:29:22,378 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-29 01:29:22,379 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-29 01:29:22,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-29 01:29:22,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-29 01:29:22,383 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-29 01:29:22,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-11-29 01:29:22,385 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 19 [2023-11-29 01:29:22,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:29:22,385 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-11-29 01:29:22,385 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-29 01:29:22,385 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-11-29 01:29:22,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 01:29:22,386 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:29:22,386 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-29 01:29:22,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 01:29:22,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:22,587 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:29:22,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:29:22,588 INFO L85 PathProgramCache]: Analyzing trace with hash -612434823, now seen corresponding path program 1 times [2023-11-29 01:29:22,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:29:22,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980028476] [2023-11-29 01:29:22,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:29:22,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:22,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:29:22,590 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:29:22,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 01:29:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:29:22,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:29:22,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:29:22,694 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-29 01:29:22,695 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:29:22,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:29:22,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980028476] [2023-11-29 01:29:22,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980028476] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:29:22,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:29:22,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:29:22,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94372152] [2023-11-29 01:29:22,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:29:22,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:29:22,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:29:22,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:29:22,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:29:22,698 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-29 01:29:22,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:29:22,736 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2023-11-29 01:29:22,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:29:22,737 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-29 01:29:22,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:29:22,738 INFO L225 Difference]: With dead ends: 66 [2023-11-29 01:29:22,738 INFO L226 Difference]: Without dead ends: 45 [2023-11-29 01:29:22,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-29 01:29:22,740 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-29 01:29:22,741 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-29 01:29:22,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-29 01:29:22,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2023-11-29 01:29:22,746 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-29 01:29:22,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2023-11-29 01:29:22,747 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 22 [2023-11-29 01:29:22,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:29:22,748 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2023-11-29 01:29:22,748 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-29 01:29:22,748 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2023-11-29 01:29:22,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 01:29:22,749 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:29:22,749 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-29 01:29:22,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-29 01:29:22,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:22,950 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:29:22,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:29:22,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1907525111, now seen corresponding path program 1 times [2023-11-29 01:29:22,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:29:22,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801671902] [2023-11-29 01:29:22,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:29:22,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:22,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:29:22,952 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:29:22,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 01:29:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:29:23,082 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-29 01:29:23,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:29:23,166 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-29 01:29:23,301 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-29 01:29:23,384 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 01:29:23,385 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 19 treesize of output 22 [2023-11-29 01:29:23,573 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 01:29:23,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 01:29:23,691 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-29 01:29:23,691 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:29:23,962 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~t~0#1.base| (_ BitVec 32)) (v_ArrVal_98 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_98))) (store .cse2 |ULTIMATE.start_main_~t~0#1.base| (store (select .cse2 |ULTIMATE.start_main_~t~0#1.base|) |c_ULTIMATE.start_main_~t~0#1.offset| (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_98 .cse0))) v_ArrVal_98)) (= .cse1 (_ bv1 32)) (= (_ bv3 32) .cse1)))) is different from false [2023-11-29 01:29:24,054 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_98 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~t~0#1.base| (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_98))) (store .cse2 |ULTIMATE.start_main_~t~0#1.base| (store (select .cse2 |ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (_ bv3 32) .cse0) (= (_ bv1 32) .cse0) (not (= (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1 (select v_ArrVal_98 .cse1))) v_ArrVal_98))))) is different from false [2023-11-29 01:29:24,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:29:24,125 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 277 treesize of output 283 [2023-11-29 01:29:26,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:29:26,833 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 193 treesize of output 185 [2023-11-29 01:29:26,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:29:26,901 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 227 treesize of output 215 [2023-11-29 01:29:26,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:29:26,964 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 427 treesize of output 409 [2023-11-29 01:29:27,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:29:27,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:29:27,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:29:27,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:29:27,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:29:27,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:29:27,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:29:27,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:29:27,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:29:27,159 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-29 01:29:27,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:29:27,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801671902] [2023-11-29 01:29:27,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [801671902] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:29:27,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:29:27,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-11-29 01:29:27,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190072646] [2023-11-29 01:29:27,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:29:27,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 01:29:27,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:29:27,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 01:29:27,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=247, Unknown=2, NotChecked=66, Total=380 [2023-11-29 01:29:27,162 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 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-29 01:29:29,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:29:29,028 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2023-11-29 01:29:29,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 01:29:29,029 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 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-29 01:29:29,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:29:29,030 INFO L225 Difference]: With dead ends: 94 [2023-11-29 01:29:29,030 INFO L226 Difference]: Without dead ends: 92 [2023-11-29 01:29:29,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=248, Invalid=948, Unknown=2, NotChecked=134, Total=1332 [2023-11-29 01:29:29,032 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 200 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 209 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:29:29,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 162 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 264 Invalid, 0 Unknown, 209 Unchecked, 1.0s Time] [2023-11-29 01:29:29,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-29 01:29:29,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 57. [2023-11-29 01:29:29,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.25) internal successors, (70), 56 states have internal predecessors, (70), 0 states have call successors, (0), 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-29 01:29:29,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2023-11-29 01:29:29,042 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 22 [2023-11-29 01:29:29,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:29:29,043 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2023-11-29 01:29:29,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 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-29 01:29:29,043 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2023-11-29 01:29:29,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 01:29:29,044 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:29:29,044 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-29 01:29:29,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-29 01:29:29,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:29,247 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:29:29,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:29:29,248 INFO L85 PathProgramCache]: Analyzing trace with hash -821079412, now seen corresponding path program 1 times [2023-11-29 01:29:29,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:29:29,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122517547] [2023-11-29 01:29:29,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:29:29,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:29,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:29:29,249 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:29:29,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 01:29:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:29:29,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:29:29,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:29:29,359 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-29 01:29:29,360 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:29:29,393 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-29 01:29:29,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:29:29,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122517547] [2023-11-29 01:29:29,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122517547] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:29:29,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:29:29,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2023-11-29 01:29:29,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138156691] [2023-11-29 01:29:29,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:29:29,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:29:29,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:29:29,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:29:29,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:29:29,396 INFO L87 Difference]: Start difference. First operand 57 states and 70 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-29 01:29:29,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:29:29,578 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2023-11-29 01:29:29,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:29:29,578 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-29 01:29:29,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:29:29,579 INFO L225 Difference]: With dead ends: 93 [2023-11-29 01:29:29,579 INFO L226 Difference]: Without dead ends: 88 [2023-11-29 01:29:29,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 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-29 01:29:29,581 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 111 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 61 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-29 01:29:29,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 61 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:29:29,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-29 01:29:29,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2023-11-29 01:29:29,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.25) internal successors, (80), 64 states have internal predecessors, (80), 0 states have call successors, (0), 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-29 01:29:29,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2023-11-29 01:29:29,595 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 24 [2023-11-29 01:29:29,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:29:29,596 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2023-11-29 01:29:29,596 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-29 01:29:29,596 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2023-11-29 01:29:29,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 01:29:29,597 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:29:29,597 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-29 01:29:29,600 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 01:29:29,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:29,798 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:29:29,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:29:29,798 INFO L85 PathProgramCache]: Analyzing trace with hash -819369390, now seen corresponding path program 1 times [2023-11-29 01:29:29,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:29:29,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721909495] [2023-11-29 01:29:29,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:29:29,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:29,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:29:29,800 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:29:29,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 01:29:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:29:29,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 01:29:29,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:29:29,917 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-29 01:29:29,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 01:29:30,006 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-29 01:29:30,006 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:29:30,073 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-29 01:29:30,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:29:30,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721909495] [2023-11-29 01:29:30,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721909495] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:29:30,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:29:30,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2023-11-29 01:29:30,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98395789] [2023-11-29 01:29:30,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:29:30,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:29:30,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:29:30,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:29:30,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:29:30,076 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-29 01:29:30,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:29:30,361 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2023-11-29 01:29:30,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:29:30,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-29 01:29:30,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:29:30,363 INFO L225 Difference]: With dead ends: 83 [2023-11-29 01:29:30,363 INFO L226 Difference]: Without dead ends: 76 [2023-11-29 01:29:30,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:29:30,364 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:29:30,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 83 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:29:30,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-29 01:29:30,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2023-11-29 01:29:30,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.25) internal successors, (85), 68 states have internal predecessors, (85), 0 states have call successors, (0), 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-29 01:29:30,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2023-11-29 01:29:30,378 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 24 [2023-11-29 01:29:30,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:29:30,378 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2023-11-29 01:29:30,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-29 01:29:30,379 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2023-11-29 01:29:30,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 01:29:30,380 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:29:30,380 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-29 01:29:30,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-29 01:29:30,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:30,580 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:29:30,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:29:30,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1293927920, now seen corresponding path program 1 times [2023-11-29 01:29:30,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:29:30,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284173028] [2023-11-29 01:29:30,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:29:30,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:30,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:29:30,582 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:29:30,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 01:29:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:29:30,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 01:29:30,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:29:30,797 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-29 01:29:30,807 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-29 01:29:30,887 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2023-11-29 01:29:30,887 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 52 treesize of output 51 [2023-11-29 01:29:30,912 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-29 01:29:30,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2023-11-29 01:29:30,919 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 9 [2023-11-29 01:29:30,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 01:29:31,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 01:29:31,035 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-29 01:29:31,076 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 01:29:31,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 21 [2023-11-29 01:29:31,099 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-29 01:29:31,115 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-29 01:29:31,115 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:29:31,140 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv3 32) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2023-11-29 01:29:31,224 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_201 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv3 32) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_201) (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))))) (= (_ bv3 32) |c_ULTIMATE.start_main_#t~mem7#1|)) is different from false [2023-11-29 01:29:31,275 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2023-11-29 01:29:31,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 65 [2023-11-29 01:29:31,352 INFO L349 Elim1Store]: treesize reduction 11, result has 84.3 percent of original size [2023-11-29 01:29:31,352 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 82 treesize of output 110 [2023-11-29 01:29:31,363 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-29 01:29:31,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:29:31,740 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 182 treesize of output 153 [2023-11-29 01:29:31,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:29:31,755 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 142 treesize of output 113 [2023-11-29 01:29:31,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:29:31,796 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 269 treesize of output 154 [2023-11-29 01:29:31,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:29:31,832 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 199 treesize of output 180 [2023-11-29 01:29:31,844 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 164 treesize of output 160 [2023-11-29 01:29:31,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 156 [2023-11-29 01:29:31,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 152 [2023-11-29 01:29:31,873 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 152 treesize of output 148 [2023-11-29 01:29:31,883 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 140 [2023-11-29 01:29:31,892 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 140 treesize of output 132 [2023-11-29 01:29:32,075 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-29 01:29:32,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:29:32,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284173028] [2023-11-29 01:29:32,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284173028] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:29:32,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:29:32,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 01:29:32,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857512407] [2023-11-29 01:29:32,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:29:32,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 01:29:32,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:29:32,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 01:29:32,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=168, Unknown=5, NotChecked=54, Total=272 [2023-11-29 01:29:32,078 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:32,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:29:32,792 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2023-11-29 01:29:32,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:29:32,794 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-29 01:29:32,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:29:32,795 INFO L225 Difference]: With dead ends: 99 [2023-11-29 01:29:32,795 INFO L226 Difference]: Without dead ends: 80 [2023-11-29 01:29:32,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=333, Unknown=5, NotChecked=78, Total=506 [2023-11-29 01:29:32,796 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 50 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:29:32,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 107 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 165 Invalid, 0 Unknown, 102 Unchecked, 0.5s Time] [2023-11-29 01:29:32,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-29 01:29:32,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2023-11-29 01:29:32,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 75 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:32,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 92 transitions. [2023-11-29 01:29:32,806 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 92 transitions. Word has length 25 [2023-11-29 01:29:32,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:29:32,806 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 92 transitions. [2023-11-29 01:29:32,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:32,806 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 92 transitions. [2023-11-29 01:29:32,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 01:29:32,807 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:29:32,807 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-29 01:29:32,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 01:29:33,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:33,008 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:29:33,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:29:33,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1436644313, now seen corresponding path program 1 times [2023-11-29 01:29:33,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:29:33,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92874389] [2023-11-29 01:29:33,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:29:33,009 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:33,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:29:33,010 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:29:33,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 01:29:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:29:33,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 01:29:33,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:29:33,128 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-29 01:29:33,128 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:29:33,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:29:33,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92874389] [2023-11-29 01:29:33,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92874389] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:29:33,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:29:33,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:29:33,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599064181] [2023-11-29 01:29:33,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:29:33,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:29:33,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:29:33,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:29:33,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:29:33,130 INFO L87 Difference]: Start difference. First operand 76 states and 92 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-29 01:29:33,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:29:33,202 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2023-11-29 01:29:33,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:29:33,202 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-29 01:29:33,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:29:33,203 INFO L225 Difference]: With dead ends: 90 [2023-11-29 01:29:33,203 INFO L226 Difference]: Without dead ends: 73 [2023-11-29 01:29:33,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-29 01:29:33,204 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 59 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.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:29:33,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 59 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:29:33,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-29 01:29:33,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2023-11-29 01:29:33,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 0 states have call successors, (0), 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-29 01:29:33,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2023-11-29 01:29:33,217 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 26 [2023-11-29 01:29:33,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:29:33,217 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2023-11-29 01:29:33,217 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-29 01:29:33,217 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2023-11-29 01:29:33,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 01:29:33,218 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:29:33,218 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:29:33,222 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 01:29:33,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:33,419 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:29:33,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:29:33,419 INFO L85 PathProgramCache]: Analyzing trace with hash -655620978, now seen corresponding path program 1 times [2023-11-29 01:29:33,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:29:33,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306484159] [2023-11-29 01:29:33,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:29:33,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:33,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:29:33,421 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:29:33,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 01:29:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:29:33,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-29 01:29:33,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:29:33,546 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 7 [2023-11-29 01:29:33,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:29:33,652 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:29:33,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:29:33,711 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-29 01:29:33,748 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-29 01:29:33,806 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-29 01:29:33,851 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 01:29:33,851 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 19 treesize of output 22 [2023-11-29 01:29:33,971 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 01:29:33,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 01:29:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:29:34,053 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:29:34,276 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_277 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~t~0#1.base| (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_277))) (store .cse1 |ULTIMATE.start_main_~t~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~t~0#1.base|) |c_ULTIMATE.start_main_~t~0#1.offset| (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (_ bv1 32)) (= .cse0 (_ bv3 32))))) is different from false [2023-11-29 01:29:34,307 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_277 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~t~0#1.base| (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_277))) (store .cse1 |ULTIMATE.start_main_~t~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (_ bv1 32)) (= (_ bv3 32) .cse0)))) is different from false [2023-11-29 01:29:34,380 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_274 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_28| (_ BitVec 32))) (let ((.cse1 (select (select (let ((.cse2 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_274) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_277))) (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_28| (store (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_28|) (_ bv0 32) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_274 .cse0))) v_ArrVal_274)) (= .cse1 (_ bv1 32)) (= .cse1 (_ bv3 32))))) is different from false [2023-11-29 01:29:34,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:29:34,786 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 3245 treesize of output 3187 [2023-11-29 01:29:34,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1219 treesize of output 1155 [2023-11-29 01:29:44,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:29:44,621 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 413 treesize of output 391 [2023-11-29 01:29:44,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:29:44,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:29:44,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:29:44,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:29:44,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:29:48,936 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-29 01:29:48,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:29:48,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306484159] [2023-11-29 01:29:48,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306484159] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:29:48,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:29:48,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-11-29 01:29:48,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073191153] [2023-11-29 01:29:48,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:29:48,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 01:29:48,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:29:48,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 01:29:48,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=385, Unknown=11, NotChecked=126, Total=600 [2023-11-29 01:29:48,939 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 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-29 01:29:50,330 WARN L854 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (bvadd (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv1 1))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv0 32)) (_ bv1 32)) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_29| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|))) (forall ((v_ArrVal_277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_274 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_28| (_ BitVec 32))) (let ((.cse1 (select (select (let ((.cse2 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_274) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_277))) (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_28| (store (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_28|) (_ bv0 32) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_274 .cse0))) v_ArrVal_274)) (= .cse1 (_ bv3 32)) (= .cse1 (_ bv1 32))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (forall ((v_ArrVal_277 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~t~0#1.base| (_ BitVec 32))) (let ((.cse3 (select (select (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_277))) (store .cse4 |ULTIMATE.start_main_~t~0#1.base| (store (select .cse4 |ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse3 (_ bv1 32)) (= (_ bv3 32) .cse3))))) is different from false [2023-11-29 01:29:50,489 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv0 32)) (_ bv1 32)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (forall ((v_ArrVal_277 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~t~0#1.base| (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_277))) (store .cse1 |ULTIMATE.start_main_~t~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (_ bv1 32)) (= (_ bv3 32) .cse0))))) is different from false [2023-11-29 01:29:52,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:29:52,280 INFO L93 Difference]: Finished difference Result 114 states and 136 transitions. [2023-11-29 01:29:52,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-29 01:29:52,281 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-29 01:29:52,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:29:52,282 INFO L225 Difference]: With dead ends: 114 [2023-11-29 01:29:52,282 INFO L226 Difference]: Without dead ends: 106 [2023-11-29 01:29:52,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=246, Invalid=1243, Unknown=13, NotChecked=390, Total=1892 [2023-11-29 01:29:52,284 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 58 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 31 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 385 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:29:52,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 204 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 305 Invalid, 6 Unknown, 385 Unchecked, 1.9s Time] [2023-11-29 01:29:52,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-29 01:29:52,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 77. [2023-11-29 01:29:52,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:52,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 95 transitions. [2023-11-29 01:29:52,296 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 95 transitions. Word has length 28 [2023-11-29 01:29:52,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:29:52,297 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 95 transitions. [2023-11-29 01:29:52,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 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-29 01:29:52,297 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 95 transitions. [2023-11-29 01:29:52,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 01:29:52,298 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:29:52,298 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-29 01:29:52,302 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 01:29:52,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:52,499 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:29:52,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:29:52,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1062138715, now seen corresponding path program 2 times [2023-11-29 01:29:52,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:29:52,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588601803] [2023-11-29 01:29:52,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:29:52,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:52,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:29:52,500 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:29:52,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 01:29:52,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:29:52,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:29:52,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:29:52,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:29:52,617 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-29 01:29:52,617 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:29:52,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:29:52,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [588601803] [2023-11-29 01:29:52,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [588601803] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:29:52,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:29:52,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:29:52,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886985906] [2023-11-29 01:29:52,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:29:52,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:29:52,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:29:52,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:29:52,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:29:52,619 INFO L87 Difference]: Start difference. First operand 77 states and 95 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-29 01:29:52,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:29:52,673 INFO L93 Difference]: Finished difference Result 140 states and 172 transitions. [2023-11-29 01:29:52,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:29:52,674 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-29 01:29:52,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:29:52,674 INFO L225 Difference]: With dead ends: 140 [2023-11-29 01:29:52,674 INFO L226 Difference]: Without dead ends: 75 [2023-11-29 01:29:52,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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-29 01:29:52,676 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-29 01:29:52,676 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-29 01:29:52,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-29 01:29:52,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2023-11-29 01:29:52,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.15625) internal successors, (74), 64 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:52,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2023-11-29 01:29:52,686 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 31 [2023-11-29 01:29:52,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:29:52,686 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2023-11-29 01:29:52,686 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-29 01:29:52,686 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2023-11-29 01:29:52,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 01:29:52,687 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:29:52,687 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-29 01:29:52,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 01:29:52,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:52,888 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:29:52,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:29:52,888 INFO L85 PathProgramCache]: Analyzing trace with hash 244490265, now seen corresponding path program 1 times [2023-11-29 01:29:52,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:29:52,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508515396] [2023-11-29 01:29:52,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:29:52,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:29:52,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:29:52,890 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:29:52,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 01:29:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:29:53,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-29 01:29:53,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:29:53,047 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 7 [2023-11-29 01:29:53,118 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-29 01:29:53,165 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:29:53,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:29:53,218 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-29 01:29:53,224 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-29 01:29:53,278 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 01:29:53,278 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-29 01:29:53,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:29:53,289 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-29 01:29:53,380 INFO L349 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2023-11-29 01:29:53,380 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 69 treesize of output 47 [2023-11-29 01:29:53,392 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-29 01:29:53,519 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-29 01:29:53,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 67 [2023-11-29 01:29:53,551 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-11-29 01:29:53,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2023-11-29 01:29:53,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2023-11-29 01:29:53,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 38 treesize of output 26 [2023-11-29 01:29:53,905 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 01:29:53,906 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 42 [2023-11-29 01:29:54,001 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 01:29:54,001 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 37 [2023-11-29 01:29:54,245 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2023-11-29 01:29:54,246 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 46 [2023-11-29 01:29:54,392 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-29 01:29:54,392 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:29:54,623 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|) v_ArrVal_390)) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_392) |c_ULTIMATE.start_main_~t~0#1.base|) |c_ULTIMATE.start_main_~t~0#1.offset|) (_ bv1 32))) is different from false [2023-11-29 01:29:54,632 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_390)) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) v_ArrVal_392)) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) (_ bv1 32))) is different from false [2023-11-29 01:29:54,946 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_388 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~p~0#1.offset| (_ BitVec 32)) (v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~t~0#1.base| (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_386))) (store .cse3 |ULTIMATE.start_main_~t~0#1.base| (store (select .cse3 |ULTIMATE.start_main_~t~0#1.base|) |c_ULTIMATE.start_main_~t~0#1.offset| (_ bv3 32)))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (_ bv3 32) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse2 v_ArrVal_390)) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~p~0#1.offset|) |ULTIMATE.start_main_~t~0#1.base|)) |ULTIMATE.start_main_~t~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) v_ArrVal_392)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)))))) is different from false [2023-11-29 01:29:55,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:29:55,682 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2023-11-29 01:29:56,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:29:56,178 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 102 treesize of output 103 [2023-11-29 01:29:56,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:29:56,329 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 378 treesize of output 377 [2023-11-29 01:29:56,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:29:56,433 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 397 treesize of output 313 [2023-11-29 01:29:56,447 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 278 treesize of output 270 [2023-11-29 01:30:02,811 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~t~0#1.base|)) (.cse4 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse6 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (let ((.cse22 (and (or .cse0 (and (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_70 (_ BitVec 32))) (or (not (= (store .cse6 .cse7 (select v_ArrVal_382 .cse7)) v_ArrVal_382)) (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse31 (let ((.cse32 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_386))) (store .cse32 v_arrayElimCell_72 (store (select .cse32 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))))) (let ((.cse29 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (_ bv3 32) (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse30 (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse29 .cse4 v_ArrVal_390)))) (or (= (_ bv1 32) (select (select (store .cse30 v_arrayElimCell_70 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store .cse30 v_arrayElimCell_74 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))))))))))) (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_70 (_ BitVec 32))) (or (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse34 (let ((.cse35 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_386))) (store .cse35 v_arrayElimCell_72 (store (select .cse35 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))))) (let ((.cse33 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (_ bv3 32) (select .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store .cse34 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse33 .cse4 v_ArrVal_390)) v_arrayElimCell_70 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimCell_72))))) (not (= (store .cse6 .cse7 (select v_ArrVal_382 .cse7)) v_ArrVal_382)))))) (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_70 (_ BitVec 32))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (or (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (let ((.cse39 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_386))) (store .cse39 v_arrayElimCell_72 (store (select .cse39 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))))) (let ((.cse38 (select .cse37 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse36 (store .cse37 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse38 .cse4 v_ArrVal_390)))) (or (= (select (select (store .cse36 v_arrayElimCell_73 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse36 v_arrayElimCell_70 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (= (_ bv3 32) (select .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimCell_72))) (not (= (store .cse6 .cse7 (select v_ArrVal_382 .cse7)) v_ArrVal_382))))))) (and (or .cse0 (and (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382))) (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_386))) (let ((.cse2 (store (select .cse5 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))) (let ((.cse3 (select (store .cse5 v_arrayElimCell_72 .cse2) |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store .cse1 v_arrayElimCell_72 .cse2) |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 .cse4 v_ArrVal_390)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) (= (_ bv3 32) (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimCell_72))))))) (not (= (store .cse6 .cse7 (select v_ArrVal_382 .cse7)) v_ArrVal_382)))) (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382))) (let ((.cse13 (store .cse8 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_386))) (let ((.cse9 (store (select .cse13 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))) (let ((.cse11 (store .cse13 v_arrayElimCell_72 .cse9))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse10 (store .cse12 .cse4 v_ArrVal_390))) (or (= (select (select (store (store (store .cse8 v_arrayElimCell_72 .cse9) |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (= (select (select (store (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse10) v_arrayElimCell_74 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))))) (= (_ bv3 32) (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (not (= (store .cse6 .cse7 (select v_ArrVal_382 .cse7)) v_ArrVal_382)))))) (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse6 .cse7 (select v_ArrVal_382 .cse7)) v_ArrVal_382)) (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_386))) (let ((.cse14 (store (select .cse15 |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv0 32) (_ bv3 32)))) (or (= (_ bv3 32) (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store (store .cse15 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse14 .cse4 v_ArrVal_390)) v_arrayElimCell_74 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)))))))) (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (or (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382))) (let ((.cse21 (store .cse16 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_386))) (let ((.cse17 (store (select .cse21 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))) (let ((.cse19 (store .cse21 v_arrayElimCell_72 .cse17))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse18 (store .cse20 .cse4 v_ArrVal_390))) (or (= (select (select (store (store (store .cse16 v_arrayElimCell_72 .cse17) |c_ULTIMATE.start_main_~a~0#1.base| .cse18) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (= (select (select (store (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| .cse18) v_arrayElimCell_73 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))))) (= (_ bv3 32) (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimCell_72))) (not (= (store .cse6 .cse7 (select v_ArrVal_382 .cse7)) v_ArrVal_382)))) (or .cse22 (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (or (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_72 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse24 (let ((.cse25 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_386))) (store .cse25 v_arrayElimCell_72 (store (select .cse25 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))))) (let ((.cse23 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (_ bv3 32) (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store (store .cse24 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse23 .cse4 v_ArrVal_390)) v_arrayElimCell_73 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (not (= (store .cse6 .cse7 (select v_ArrVal_382 .cse7)) v_ArrVal_382)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimCell_72))))) (not .cse0)) (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse28 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_386))) (let ((.cse26 (store (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv0 32) (_ bv3 32)))) (let ((.cse27 (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse26 .cse4 v_ArrVal_390)))) (or (= (_ bv3 32) (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store .cse27 v_arrayElimCell_73 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (= (select (select (store .cse27 v_arrayElimCell_74 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))))))) (not (= (store .cse6 .cse7 (select v_ArrVal_382 .cse7)) v_ArrVal_382)))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_main_~p~0#1.offset|) .cse22)))) is different from true [2023-11-29 01:30:08,670 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse7 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (let ((.cse17 (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_34| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_34|))) (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_70 (_ BitVec 32))) (or (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse29 (let ((.cse31 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382) |v_ULTIMATE.start_main_~t~0#1.base_34| v_ArrVal_386))) (store .cse31 v_arrayElimCell_72 (store (select .cse31 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse30 .cse5 v_ArrVal_390)) v_arrayElimCell_70 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) (= (_ bv3 32) (select .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimCell_72))))) (not (= (store .cse7 .cse8 (select v_ArrVal_382 .cse8)) v_ArrVal_382)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_34|))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_34| (_ BitVec 32))) (or (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_70 (_ BitVec 32))) (or (not (= (store .cse7 .cse8 (select v_ArrVal_382 .cse8)) v_ArrVal_382)) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (or (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (let ((.cse35 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382) |v_ULTIMATE.start_main_~t~0#1.base_34| v_ArrVal_386))) (store .cse35 v_arrayElimCell_72 (store (select .cse35 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))))) (let ((.cse32 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (_ bv3 32) (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse33 (store .cse34 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse32 .cse5 v_ArrVal_390)))) (or (= (select (select (store .cse33 v_arrayElimCell_70 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (= (select (select (store .cse33 v_arrayElimCell_73 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))))))))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimCell_72))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_34|))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_34| (_ BitVec 32))) (or (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_70 (_ BitVec 32))) (or (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse38 (let ((.cse39 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382) |v_ULTIMATE.start_main_~t~0#1.base_34| v_ArrVal_386))) (store .cse39 v_arrayElimCell_72 (store (select .cse39 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))))) (let ((.cse36 (select .cse38 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (_ bv3 32) (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse37 (store .cse38 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse36 .cse5 v_ArrVal_390)))) (or (= (select (select (store .cse37 v_arrayElimCell_70 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse37 v_arrayElimCell_74 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (not (= (store .cse7 .cse8 (select v_ArrVal_382 .cse8)) v_ArrVal_382)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_34|))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_34|)))))) (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_34| (_ BitVec 32))) (or (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimCell_72) (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382))) (let ((.cse6 (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_34| v_ArrVal_386))) (let ((.cse1 (store (select .cse6 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))) (let ((.cse3 (store .cse6 v_arrayElimCell_72 .cse1))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse2 (store .cse4 .cse5 v_ArrVal_390))) (or (= (select (select (store (store (store .cse0 v_arrayElimCell_72 .cse1) |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |v_ULTIMATE.start_main_~t~0#1.base_34| v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (= (select (select (store (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) v_arrayElimCell_73 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))))) (= (_ bv3 32) (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))))) (not (= (store .cse7 .cse8 (select v_ArrVal_382 .cse8)) v_ArrVal_382)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_34|))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_34| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_34|))) (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382))) (let ((.cse12 (store .cse9 |v_ULTIMATE.start_main_~t~0#1.base_34| v_ArrVal_386))) (let ((.cse10 (store (select .cse12 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))) (let ((.cse11 (select (store .cse12 v_arrayElimCell_72 .cse10) |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store .cse9 v_arrayElimCell_72 .cse10) |c_ULTIMATE.start_main_~a~0#1.base| (store .cse11 .cse5 v_ArrVal_390)) |v_ULTIMATE.start_main_~t~0#1.base_34| v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) (= (_ bv3 32) (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimCell_72))))))) (not (= (store .cse7 .cse8 (select v_ArrVal_382 .cse8)) v_ArrVal_382)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_34|))) (or (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_72 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382))) (let ((.cse16 (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_386))) (let ((.cse14 (store (select .cse16 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))) (let ((.cse15 (select (store .cse16 v_arrayElimCell_72 .cse14) |c_ULTIMATE.start_main_~a~0#1.base|))) (or (not (= (store .cse7 .cse8 (select v_ArrVal_382 .cse8)) v_ArrVal_382)) (= (_ bv1 32) (select (select (store (store (store .cse13 v_arrayElimCell_72 .cse14) |c_ULTIMATE.start_main_~a~0#1.base| (store .cse15 .cse5 v_ArrVal_390)) v_arrayElimCell_73 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimCell_72) (= (_ bv3 32) (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|)))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_main_~p~0#1.offset|) .cse17) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_34| (_ BitVec 32))) (or (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse7 .cse8 (select v_ArrVal_382 .cse8)) v_ArrVal_382)) (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse20 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382) |v_ULTIMATE.start_main_~t~0#1.base_34| v_ArrVal_386))) (let ((.cse19 (store (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv0 32) (_ bv3 32)))) (let ((.cse18 (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse19 .cse5 v_ArrVal_390)))) (or (= (select (select (store .cse18 v_arrayElimCell_73 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (= (_ bv3 32) (select .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store .cse18 v_arrayElimCell_74 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_34|))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_34| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_34|))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_34|) (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382))) (let ((.cse26 (store .cse23 |v_ULTIMATE.start_main_~t~0#1.base_34| v_ArrVal_386))) (let ((.cse24 (store (select .cse26 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))) (let ((.cse21 (store .cse26 v_arrayElimCell_72 .cse24))) (let ((.cse25 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse22 (store .cse25 .cse5 v_ArrVal_390))) (or (= (_ bv1 32) (select (select (store (store .cse21 |c_ULTIMATE.start_main_~a~0#1.base| .cse22) v_arrayElimCell_74 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store (store (store .cse23 v_arrayElimCell_72 .cse24) |c_ULTIMATE.start_main_~a~0#1.base| .cse22) |v_ULTIMATE.start_main_~t~0#1.base_34| v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))))) (= (_ bv3 32) (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (not (= (store .cse7 .cse8 (select v_ArrVal_382 .cse8)) v_ArrVal_382)))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_34| (_ BitVec 32))) (or (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse7 .cse8 (select v_ArrVal_382 .cse8)) v_ArrVal_382)) (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382) |v_ULTIMATE.start_main_~t~0#1.base_34| v_ArrVal_386))) (let ((.cse27 (store (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv0 32) (_ bv3 32)))) (or (= (_ bv3 32) (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse27 .cse5 v_ArrVal_390)) v_arrayElimCell_74 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_34|))))) (or .cse17 (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|))))) is different from true [2023-11-29 01:30:08,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:30:08,876 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 328 treesize of output 328 [2023-11-29 01:30:08,888 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 320 treesize of output 308 [2023-11-29 01:30:08,910 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 239 treesize of output 223 [2023-11-29 01:30:09,934 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 6087 treesize of output 5923 [2023-11-29 01:30:11,069 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:11,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:30:11,245 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 1318 treesize of output 1298 [2023-11-29 01:30:11,289 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 1032 treesize of output 1008 [2023-11-29 01:30:11,336 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 490 treesize of output 458 [2023-11-29 01:30:13,033 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 112 treesize of output 104 [2023-11-29 01:30:13,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:30:13,140 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:13,144 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 72 treesize of output 70 [2023-11-29 01:30:13,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:30:13,153 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 1 case distinctions, treesize of input 16 treesize of output 6 [2023-11-29 01:30:13,156 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-29 01:30:13,163 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 45 treesize of output 37 [2023-11-29 01:30:13,170 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-29 01:30:13,195 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:13,195 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:13,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:30:13,230 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 490 treesize of output 472 [2023-11-29 01:30:13,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 230 treesize of output 214 [2023-11-29 01:30:14,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:30:14,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 83 [2023-11-29 01:30:14,218 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:14,218 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:14,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:30:14,310 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 652 treesize of output 636 [2023-11-29 01:30:14,346 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 483 treesize of output 451 [2023-11-29 01:30:14,369 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 588 treesize of output 576 [2023-11-29 01:30:14,963 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-29 01:30:14,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-11-29 01:30:15,000 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:15,001 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:15,002 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:15,008 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 310 treesize of output 284 [2023-11-29 01:30:15,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 203 [2023-11-29 01:30:15,034 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 252 treesize of output 228 [2023-11-29 01:30:15,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:30:15,155 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 1 case distinctions, treesize of input 16 treesize of output 6 [2023-11-29 01:30:15,161 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-29 01:30:15,174 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:15,174 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:15,175 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:15,180 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 193 treesize of output 175 [2023-11-29 01:30:15,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:30:15,196 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 1 case distinctions, treesize of input 16 treesize of output 6 [2023-11-29 01:30:15,201 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-29 01:30:15,211 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 159 treesize of output 143 [2023-11-29 01:30:15,230 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 102 treesize of output 94 [2023-11-29 01:30:15,312 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:15,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:30:15,356 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 103 treesize of output 105 [2023-11-29 01:30:15,368 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 56 treesize of output 52 [2023-11-29 01:30:15,461 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 177 treesize of output 171 [2023-11-29 01:30:15,506 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:15,506 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:15,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:30:15,537 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 253 treesize of output 243 [2023-11-29 01:30:16,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:30:16,354 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 193 treesize of output 185 [2023-11-29 01:30:16,382 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:16,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:30:16,511 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 1618 treesize of output 1598 [2023-11-29 01:30:16,581 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 987 treesize of output 923 [2023-11-29 01:30:16,619 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 1208 treesize of output 1184 [2023-11-29 01:30:19,379 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:19,395 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 40 treesize of output 38 [2023-11-29 01:30:19,420 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:19,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:30:19,429 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:19,437 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 37 treesize of output 33 [2023-11-29 01:30:19,476 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:19,476 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:19,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:30:19,513 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 610 treesize of output 592 [2023-11-29 01:30:19,535 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 459 treesize of output 427 [2023-11-29 01:30:20,011 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 5 treesize of output 3 [2023-11-29 01:30:20,018 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:20,027 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 22 treesize of output 20 [2023-11-29 01:30:20,046 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:20,047 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:20,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:30:20,084 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 373 treesize of output 363 [2023-11-29 01:30:20,101 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 230 treesize of output 214 [2023-11-29 01:30:20,497 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 5 treesize of output 3 [2023-11-29 01:30:20,505 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:30:20,512 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 22 treesize of output 20 [2023-11-29 01:30:52,892 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-29 01:30:52,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:30:52,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508515396] [2023-11-29 01:30:52,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508515396] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:30:52,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:30:52,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2023-11-29 01:30:52,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210577195] [2023-11-29 01:30:52,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:30:52,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-29 01:30:52,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:30:52,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-29 01:30:52,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=569, Unknown=54, NotChecked=270, Total=992 [2023-11-29 01:30:52,895 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 32 states, 32 states have (on average 1.875) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 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-29 01:30:57,164 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse8 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse9 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse18 (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_34| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_34|))) (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_70 (_ BitVec 32))) (or (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse31 (let ((.cse33 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382) |v_ULTIMATE.start_main_~t~0#1.base_34| v_ArrVal_386))) (store .cse33 v_arrayElimCell_72 (store (select .cse33 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse32 .cse6 v_ArrVal_390)) v_arrayElimCell_70 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) (= (_ bv3 32) (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimCell_72))))) (not (= (store .cse8 .cse9 (select v_ArrVal_382 .cse9)) v_ArrVal_382)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_34|))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_34| (_ BitVec 32))) (or (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_70 (_ BitVec 32))) (or (not (= (store .cse8 .cse9 (select v_ArrVal_382 .cse9)) v_ArrVal_382)) (forall ((v_arrayElimCell_72 (_ BitVec 32))) (or (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (let ((.cse37 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382) |v_ULTIMATE.start_main_~t~0#1.base_34| v_ArrVal_386))) (store .cse37 v_arrayElimCell_72 (store (select .cse37 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))))) (let ((.cse34 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (_ bv3 32) (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse35 (store .cse36 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse34 .cse6 v_ArrVal_390)))) (or (= (select (select (store .cse35 v_arrayElimCell_70 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (= (select (select (store .cse35 v_arrayElimCell_73 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))))))))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimCell_72))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_34|))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_34| (_ BitVec 32))) (or (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_70 (_ BitVec 32))) (or (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse40 (let ((.cse41 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382) |v_ULTIMATE.start_main_~t~0#1.base_34| v_ArrVal_386))) (store .cse41 v_arrayElimCell_72 (store (select .cse41 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))))) (let ((.cse38 (select .cse40 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (_ bv3 32) (select .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse39 (store .cse40 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse38 .cse6 v_ArrVal_390)))) (or (= (select (select (store .cse39 v_arrayElimCell_70 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse39 v_arrayElimCell_74 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (not (= (store .cse8 .cse9 (select v_ArrVal_382 .cse9)) v_ArrVal_382)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_34|))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_34|))))) (.cse28 (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_34| (_ BitVec 32))) (or (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimCell_72) (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382))) (let ((.cse7 (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_34| v_ArrVal_386))) (let ((.cse2 (store (select .cse7 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))) (let ((.cse4 (store .cse7 v_arrayElimCell_72 .cse2))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse3 (store .cse5 .cse6 v_ArrVal_390))) (or (= (select (select (store (store (store .cse1 v_arrayElimCell_72 .cse2) |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |v_ULTIMATE.start_main_~t~0#1.base_34| v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (= (select (select (store (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) v_arrayElimCell_73 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))))) (= (_ bv3 32) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))))) (not (= (store .cse8 .cse9 (select v_ArrVal_382 .cse9)) v_ArrVal_382)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_34|))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_34| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_34|))) (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382))) (let ((.cse13 (store .cse10 |v_ULTIMATE.start_main_~t~0#1.base_34| v_ArrVal_386))) (let ((.cse11 (store (select .cse13 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))) (let ((.cse12 (select (store .cse13 v_arrayElimCell_72 .cse11) |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store .cse10 v_arrayElimCell_72 .cse11) |c_ULTIMATE.start_main_~a~0#1.base| (store .cse12 .cse6 v_ArrVal_390)) |v_ULTIMATE.start_main_~t~0#1.base_34| v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) (= (_ bv3 32) (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimCell_72))))))) (not (= (store .cse8 .cse9 (select v_ArrVal_382 .cse9)) v_ArrVal_382)))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_34|))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)) (or (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_72 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382))) (let ((.cse17 (store .cse14 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_386))) (let ((.cse15 (store (select .cse17 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))) (let ((.cse16 (select (store .cse17 v_arrayElimCell_72 .cse15) |c_ULTIMATE.start_main_~a~0#1.base|))) (or (not (= (store .cse8 .cse9 (select v_ArrVal_382 .cse9)) v_ArrVal_382)) (= (_ bv1 32) (select (select (store (store (store .cse14 v_arrayElimCell_72 .cse15) |c_ULTIMATE.start_main_~a~0#1.base| (store .cse16 .cse6 v_ArrVal_390)) v_arrayElimCell_73 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimCell_72) (= (_ bv3 32) (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (not (= (_ bv0 1) .cse0))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_main_~p~0#1.offset|) .cse18) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_34| (_ BitVec 32))) (or (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse8 .cse9 (select v_ArrVal_382 .cse9)) v_ArrVal_382)) (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse21 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382) |v_ULTIMATE.start_main_~t~0#1.base_34| v_ArrVal_386))) (let ((.cse20 (store (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv0 32) (_ bv3 32)))) (let ((.cse19 (store .cse21 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse20 .cse6 v_ArrVal_390)))) (or (= (select (select (store .cse19 v_arrayElimCell_73 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (= (_ bv3 32) (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store .cse19 v_arrayElimCell_74 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_34|))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_34| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_34|))) (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_34|) (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382))) (let ((.cse27 (store .cse24 |v_ULTIMATE.start_main_~t~0#1.base_34| v_ArrVal_386))) (let ((.cse25 (store (select .cse27 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))) (let ((.cse22 (store .cse27 v_arrayElimCell_72 .cse25))) (let ((.cse26 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse23 (store .cse26 .cse6 v_ArrVal_390))) (or (= (_ bv1 32) (select (select (store (store .cse22 |c_ULTIMATE.start_main_~a~0#1.base| .cse23) v_arrayElimCell_74 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store (store (store .cse24 v_arrayElimCell_72 .cse25) |c_ULTIMATE.start_main_~a~0#1.base| .cse23) |v_ULTIMATE.start_main_~t~0#1.base_34| v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))))) (= (_ bv3 32) (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (not (= (store .cse8 .cse9 (select v_ArrVal_382 .cse9)) v_ArrVal_382)))))) .cse28 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_34| (_ BitVec 32))) (or (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse8 .cse9 (select v_ArrVal_382 .cse9)) v_ArrVal_382)) (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382) |v_ULTIMATE.start_main_~t~0#1.base_34| v_ArrVal_386))) (let ((.cse29 (store (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv0 32) (_ bv3 32)))) (or (= (_ bv3 32) (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse29 .cse6 v_ArrVal_390)) v_arrayElimCell_74 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_34|))))) (or .cse18 .cse28) (= (select .cse8 (_ bv0 32)) (_ bv1 32))))) is different from true [2023-11-29 01:31:01,188 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse6 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse0 (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~t~0#1.base|))) (let ((.cse24 (not .cse0)) (.cse22 (and (or .cse0 (and (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_70 (_ BitVec 32))) (or (not (= (store .cse6 .cse7 (select v_ArrVal_382 .cse7)) v_ArrVal_382)) (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse33 (let ((.cse34 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_386))) (store .cse34 v_arrayElimCell_72 (store (select .cse34 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))))) (let ((.cse31 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (_ bv3 32) (select .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse32 (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse31 .cse4 v_ArrVal_390)))) (or (= (_ bv1 32) (select (select (store .cse32 v_arrayElimCell_70 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store .cse32 v_arrayElimCell_74 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))))))))))) (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_70 (_ BitVec 32))) (or (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse36 (let ((.cse37 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_386))) (store .cse37 v_arrayElimCell_72 (store (select .cse37 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))))) (let ((.cse35 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (_ bv3 32) (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store .cse36 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse35 .cse4 v_ArrVal_390)) v_arrayElimCell_70 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimCell_72))))) (not (= (store .cse6 .cse7 (select v_ArrVal_382 .cse7)) v_ArrVal_382)))))) (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_70 (_ BitVec 32))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (or (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (let ((.cse41 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_386))) (store .cse41 v_arrayElimCell_72 (store (select .cse41 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse38 (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse40 .cse4 v_ArrVal_390)))) (or (= (select (select (store .cse38 v_arrayElimCell_73 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse38 v_arrayElimCell_70 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (= (_ bv3 32) (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimCell_72))) (not (= (store .cse6 .cse7 (select v_ArrVal_382 .cse7)) v_ArrVal_382)))))) (.cse23 (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (or .cse0 (and (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382))) (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_386))) (let ((.cse2 (store (select .cse5 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))) (let ((.cse3 (select (store .cse5 v_arrayElimCell_72 .cse2) |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store .cse1 v_arrayElimCell_72 .cse2) |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 .cse4 v_ArrVal_390)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) (= (_ bv3 32) (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimCell_72))))))) (not (= (store .cse6 .cse7 (select v_ArrVal_382 .cse7)) v_ArrVal_382)))) (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_72 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382))) (let ((.cse13 (store .cse8 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_386))) (let ((.cse9 (store (select .cse13 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))) (let ((.cse11 (store .cse13 v_arrayElimCell_72 .cse9))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse10 (store .cse12 .cse4 v_ArrVal_390))) (or (= (select (select (store (store (store .cse8 v_arrayElimCell_72 .cse9) |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (= (select (select (store (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse10) v_arrayElimCell_74 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))))) (= (_ bv3 32) (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (not (= (store .cse6 .cse7 (select v_ArrVal_382 .cse7)) v_ArrVal_382)))))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)) (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse6 .cse7 (select v_ArrVal_382 .cse7)) v_ArrVal_382)) (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_386))) (let ((.cse14 (store (select .cse15 |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv0 32) (_ bv3 32)))) (or (= (_ bv3 32) (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store (store .cse15 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse14 .cse4 v_ArrVal_390)) v_arrayElimCell_74 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)))))))) (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_72 (_ BitVec 32))) (or (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382))) (let ((.cse21 (store .cse16 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_386))) (let ((.cse17 (store (select .cse21 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))) (let ((.cse19 (store .cse21 v_arrayElimCell_72 .cse17))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse18 (store .cse20 .cse4 v_ArrVal_390))) (or (= (select (select (store (store (store .cse16 v_arrayElimCell_72 .cse17) |c_ULTIMATE.start_main_~a~0#1.base| .cse18) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (= (select (select (store (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| .cse18) v_arrayElimCell_73 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))))) (= (_ bv3 32) (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimCell_72))) (not (= (store .cse6 .cse7 (select v_ArrVal_382 .cse7)) v_ArrVal_382)))) (or .cse22 .cse23) .cse24 (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (or (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_72 (_ BitVec 32)) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse26 (let ((.cse27 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_386))) (store .cse27 v_arrayElimCell_72 (store (select .cse27 v_arrayElimCell_72) (_ bv0 32) (_ bv3 32)))))) (let ((.cse25 (select .cse26 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (_ bv3 32) (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store (store .cse26 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse25 .cse4 v_ArrVal_390)) v_arrayElimCell_73 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (not (= (store .cse6 .cse7 (select v_ArrVal_382 .cse7)) v_ArrVal_382)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimCell_72))))) .cse24) (forall ((v_ArrVal_382 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_390 (_ BitVec 32)) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32))) (let ((.cse30 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_386))) (let ((.cse28 (store (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv0 32) (_ bv3 32)))) (let ((.cse29 (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse28 .cse4 v_ArrVal_390)))) (or (= (_ bv3 32) (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store .cse29 v_arrayElimCell_73 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (= (select (select (store .cse29 v_arrayElimCell_74 v_ArrVal_392) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))))))) (not (= (store .cse6 .cse7 (select v_ArrVal_382 .cse7)) v_ArrVal_382)))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_main_~p~0#1.offset|) .cse22) .cse23 (= (select .cse6 (_ bv0 32)) (_ bv1 32))))) is different from true [2023-11-29 01:31:04,477 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_392) |c_ULTIMATE.start_main_~l1~0#1.base|) |c_ULTIMATE.start_main_~l1~0#1.offset|) (_ bv1 32))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~l1~0#1.base|) (_ bv0 32)) (_ bv1 32)) (= (_ bv0 32) |c_ULTIMATE.start_main_~l1~0#1.offset|)) is different from false [2023-11-29 01:31:05,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:31:05,391 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2023-11-29 01:31:05,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 01:31:05,392 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.875) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 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-29 01:31:05,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:31:05,393 INFO L225 Difference]: With dead ends: 85 [2023-11-29 01:31:05,393 INFO L226 Difference]: Without dead ends: 83 [2023-11-29 01:31:05,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 51.5s TimeCoverageRelationStatistics Valid=149, Invalid=941, Unknown=64, NotChecked=568, Total=1722 [2023-11-29 01:31:05,395 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 10 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 447 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:31:05,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 296 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 468 Invalid, 6 Unknown, 447 Unchecked, 3.3s Time] [2023-11-29 01:31:05,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-29 01:31:05,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 71. [2023-11-29 01:31:05,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 70 states have internal predecessors, (81), 0 states have call successors, (0), 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-29 01:31:05,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2023-11-29 01:31:05,408 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 31 [2023-11-29 01:31:05,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:31:05,409 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2023-11-29 01:31:05,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.875) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 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-29 01:31:05,409 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2023-11-29 01:31:05,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 01:31:05,410 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:31:05,410 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, 1, 1] [2023-11-29 01:31:05,414 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 01:31:05,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:31:05,611 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:31:05,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:31:05,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1268022284, now seen corresponding path program 1 times [2023-11-29 01:31:05,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:31:05,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804690968] [2023-11-29 01:31:05,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:31:05,611 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:31:05,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:31:05,612 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:31:05,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 01:31:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:31:05,747 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-29 01:31:05,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:31:05,755 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 7 [2023-11-29 01:31:05,891 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:31:05,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:31:05,953 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-29 01:31:06,050 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 01:31:06,051 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-29 01:31:06,178 INFO L349 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2023-11-29 01:31:06,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 39 [2023-11-29 01:31:06,386 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-29 01:31:06,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 71 [2023-11-29 01:31:06,399 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 28 treesize of output 24 [2023-11-29 01:31:06,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2023-11-29 01:31:06,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 01:31:06,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 01:31:06,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:31:06,972 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-29 01:31:06,978 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-29 01:31:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:31:07,239 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:31:07,635 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~l1~0#1.offset|))) (and (forall ((v_ArrVal_451 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_~l1~0#1.base|) .cse0))) (forall ((v_ArrVal_452 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_452) |c_ULTIMATE.start_main_~l1~0#1.base|) .cse0) (_ bv0 32))))) is different from false [2023-11-29 01:31:07,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:31:07,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-11-29 01:31:07,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2023-11-29 01:31:07,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:31:08,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-11-29 01:31:08,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:31:08,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2023-11-29 01:31:08,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:31:08,883 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2023-11-29 01:31:09,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:31:09,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-11-29 01:31:09,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:31:09,275 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 173 treesize of output 166 [2023-11-29 01:31:09,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:31:09,301 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 66 treesize of output 63 [2023-11-29 01:31:09,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2023-11-29 01:31:09,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:31:09,431 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 28 treesize of output 29 [2023-11-29 01:31:09,435 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:31:09,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:31:09,457 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 35 treesize of output 36 [2023-11-29 01:31:09,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:31:09,478 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 28 treesize of output 30 [2023-11-29 01:31:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-29 01:31:25,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:31:25,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804690968] [2023-11-29 01:31:25,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804690968] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:31:25,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:31:25,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2023-11-29 01:31:25,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796891667] [2023-11-29 01:31:25,942 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:31:25,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-29 01:31:25,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:31:25,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-29 01:31:25,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=643, Unknown=27, NotChecked=52, Total=812 [2023-11-29 01:31:25,944 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 0 states have call successors, (0), 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-29 01:31:31,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:31:31,021 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2023-11-29 01:31:31,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 01:31:31,023 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-11-29 01:31:31,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:31:31,024 INFO L225 Difference]: With dead ends: 115 [2023-11-29 01:31:31,024 INFO L226 Difference]: Without dead ends: 108 [2023-11-29 01:31:31,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=275, Invalid=1665, Unknown=44, NotChecked=86, Total=2070 [2023-11-29 01:31:31,026 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 210 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 37 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:31:31,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 277 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 506 Invalid, 4 Unknown, 84 Unchecked, 2.9s Time] [2023-11-29 01:31:31,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-29 01:31:31,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 91. [2023-11-29 01:31:31,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.1666666666666667) internal successors, (105), 90 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:31:31,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2023-11-29 01:31:31,043 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 33 [2023-11-29 01:31:31,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:31:31,043 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2023-11-29 01:31:31,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 0 states have call successors, (0), 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-29 01:31:31,043 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2023-11-29 01:31:31,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 01:31:31,044 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:31:31,044 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:31:31,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 01:31:31,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:31:31,245 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:31:31,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:31:31,245 INFO L85 PathProgramCache]: Analyzing trace with hash 202694188, now seen corresponding path program 2 times [2023-11-29 01:31:31,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:31:31,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776470696] [2023-11-29 01:31:31,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:31:31,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:31:31,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:31:31,246 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:31:31,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e80a00f-04fe-4341-af9c-715d2838c75c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 01:31:31,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:31:31,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:31:31,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-29 01:31:31,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:31:31,444 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 7 [2023-11-29 01:31:31,648 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:31:31,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:31:31,771 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-29 01:31:31,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:31:31,987 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 01:31:31,988 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-29 01:31:32,038 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 01:31:32,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2023-11-29 01:31:32,145 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-29 01:31:32,146 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 24 treesize of output 26 [2023-11-29 01:31:32,331 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-11-29 01:31:32,331 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 105 treesize of output 67 [2023-11-29 01:31:32,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2023-11-29 01:31:32,647 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 01:31:32,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 80 [2023-11-29 01:31:32,666 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 01:31:32,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:31:32,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2023-11-29 01:31:33,170 INFO L349 Elim1Store]: treesize reduction 44, result has 37.1 percent of original size [2023-11-29 01:31:33,171 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 32 treesize of output 37 [2023-11-29 01:31:33,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:31:33,193 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 0 case distinctions, treesize of input 27 treesize of output 20 [2023-11-29 01:31:33,244 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 01:31:33,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 52 [2023-11-29 01:31:33,251 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 40 treesize of output 30 [2023-11-29 01:31:33,360 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 27 treesize of output 15 [2023-11-29 01:31:33,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:31:33,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 01:31:33,515 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-29 01:31:33,572 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:31:33,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:31:33,648 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv3 32) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_521) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2023-11-29 01:31:33,818 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv3 32) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_520) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_521) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))))) is different from false [2023-11-29 01:31:33,841 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2)) (.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2)))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_520) .cse0 v_ArrVal_521) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_519) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_518) .cse0) .cse1)))) (_ bv3 32))) is different from false [2023-11-29 01:31:33,892 WARN L854 $PredicateComparison]: unable to prove that (or (= (_ bv3 32) |c_ULTIMATE.start_main_#t~mem7#1|) (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv3 32) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse1 (bvadd (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv4 32)))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_520) .cse0 v_ArrVal_521) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) .cse0) .cse1))))))) is different from false [2023-11-29 01:31:33,971 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2023-11-29 01:31:33,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 119 [2023-11-29 01:31:34,143 INFO L349 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2023-11-29 01:31:34,143 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 903 treesize of output 909 [2023-11-29 01:31:34,162 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 183 treesize of output 119 [2023-11-29 01:31:34,176 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 152 treesize of output 120 [2023-11-29 01:32:23,711 WARN L293 SmtUtils]: Spent 12.33s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:32:29,485 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse6 (_ bv0 32)))) (.cse4 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_44| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_44|) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 .cse6 |v_ULTIMATE.start_main_~t~0#1.base_44|)) |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_517))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse1) (bvadd (_ bv4 32) (select (select (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse0) (not (= .cse1 .cse0))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_44|))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_44| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_44|) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_516)) (.cse7 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 .cse6 |v_ULTIMATE.start_main_~t~0#1.base_44|)) |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_517))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse9 (bvadd (_ bv4 32) (select (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (or (forall ((v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse8) .cse9)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) .cse8) .cse9)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_44|))))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_44| (_ BitVec 32))) (or (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 .cse6 |v_ULTIMATE.start_main_~t~0#1.base_44|)) |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_517))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse12) (bvadd (_ bv4 32) (select (select (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse11) (not (= .cse12 .cse11))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_44|))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_44| (_ BitVec 32))) (or (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (let ((.cse15 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_516))) (select (select (store .cse15 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 .cse6 |v_ULTIMATE.start_main_~t~0#1.base_44|)) |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_517) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (bvadd (_ bv4 32) (select (select .cse15 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) (or (= .cse14 (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse14)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_44|))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_44| (_ BitVec 32))) (or (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (let ((.cse16 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 .cse6 |v_ULTIMATE.start_main_~t~0#1.base_44|)) |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_517))) (select (store .cse16 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) (select (select .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (bvadd (_ bv4 32) (select (select (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) |v_ULTIMATE.start_main_~t~0#1.base_44|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_44|))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_44| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_44|))) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_516)) (.cse20 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 .cse6 |v_ULTIMATE.start_main_~t~0#1.base_44|)) |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_517))) (let ((.cse18 (select (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse19 (bvadd (_ bv4 32) (select (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (or (= (select (select (store .cse17 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) .cse18) .cse19) (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse18) .cse19)))))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_44| (_ BitVec 32))) (or (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_516)) (.cse22 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 .cse6 |v_ULTIMATE.start_main_~t~0#1.base_44|)) |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_517))) (let ((.cse21 (select (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse23 (bvadd (_ bv4 32) (select (select .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (or (forall ((v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= .cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse21) .cse23)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store .cse24 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) .cse21) .cse23)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_44|))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_44| (_ BitVec 32))) (or (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_516)) (.cse25 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 .cse6 |v_ULTIMATE.start_main_~t~0#1.base_44|)) |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_517))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse27 (bvadd (_ bv4 32) (select (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (or (forall ((v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store .cse25 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse26) .cse27)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) .cse26) .cse27)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_44|))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_44| (_ BitVec 32))) (or (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (select (let ((.cse30 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 .cse6 |v_ULTIMATE.start_main_~t~0#1.base_44|)) |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_517))) (select (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) (select (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (bvadd (_ bv4 32) (select (select (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (or (= .cse29 |v_ULTIMATE.start_main_~t~0#1.base_44|) (not (= |c_ULTIMATE.start_main_~a~0#1.base| .cse29))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_44|))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_44| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_44|))) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse31 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_516))) (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 .cse6 |v_ULTIMATE.start_main_~t~0#1.base_44|)) |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_517) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (bvadd (_ bv4 32) (select (select .cse31 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (_ bv0 32))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_44| (_ BitVec 32))) (or (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 .cse6 |v_ULTIMATE.start_main_~t~0#1.base_44|)) |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_517))) (let ((.cse33 (select (select .cse34 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse32 (select (select (store .cse34 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse33) (bvadd (_ bv4 32) (select (select (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (or (= .cse32 |v_ULTIMATE.start_main_~t~0#1.base_44|) (not (= .cse33 .cse32))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_44|))))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_44| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_44|) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_516)) (.cse36 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 .cse6 |v_ULTIMATE.start_main_~t~0#1.base_44|)) |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_517))) (let ((.cse35 (select (select .cse36 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse37 (bvadd (_ bv4 32) (select (select .cse38 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (or (forall ((v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= .cse35 (select (select (store .cse36 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse35) .cse37)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store .cse38 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) .cse35) .cse37)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_44|))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_44| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_44|) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 .cse6 |v_ULTIMATE.start_main_~t~0#1.base_44|)) |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_517))) (let ((.cse40 (select (select .cse41 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse39 (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse40) (bvadd (_ bv4 32) (select (select (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (or (= .cse39 |v_ULTIMATE.start_main_~t~0#1.base_44|) (not (= .cse40 .cse39))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_44|))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_44| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_44|) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (let ((.cse42 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 .cse6 |v_ULTIMATE.start_main_~t~0#1.base_44|)) |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_517))) (select (store .cse42 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) (select (select .cse42 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (bvadd (_ bv4 32) (select (select (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) |v_ULTIMATE.start_main_~t~0#1.base_44|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_44|))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_44| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_44|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_44|))) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_516)) (.cse46 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 .cse6 |v_ULTIMATE.start_main_~t~0#1.base_44|)) |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_517))) (let ((.cse44 (select (select .cse46 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse45 (bvadd (_ bv4 32) (select (select .cse43 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (or (= (select (select (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) .cse44) .cse45) (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store .cse46 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse44) .cse45)))))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_44| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_44|) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (let ((.cse48 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_516))) (select (select (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 .cse6 |v_ULTIMATE.start_main_~t~0#1.base_44|)) |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_517) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (bvadd (_ bv4 32) (select (select .cse48 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) (or (= .cse47 (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse47)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_44|))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_44| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_44|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_44|))) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse49 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_516))) (select (select (store .cse49 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 .cse6 |v_ULTIMATE.start_main_~t~0#1.base_44|)) |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_517) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (bvadd (_ bv4 32) (select (select .cse49 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (_ bv0 32))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_44| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_44|) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (let ((.cse50 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 .cse6 |v_ULTIMATE.start_main_~t~0#1.base_44|)) |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_517))) (select (store .cse50 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) (select (select .cse50 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (bvadd (_ bv4 32) (select (select (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_44|)))))))) is different from true [2023-11-29 01:32:29,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:29,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 116 [2023-11-29 01:32:29,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:29,616 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 138 [2023-11-29 01:32:29,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:29,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2023-11-29 01:32:29,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:29,706 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2023-11-29 01:32:29,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:29,779 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 109 [2023-11-29 01:32:29,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:29,799 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 94 [2023-11-29 01:32:29,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:29,877 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 103 [2023-11-29 01:32:29,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:29,893 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 93 [2023-11-29 01:32:29,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:29,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 126 [2023-11-29 01:32:29,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:29,985 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 106 [2023-11-29 01:32:30,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:30,082 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2023-11-29 01:32:30,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:30,098 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2023-11-29 01:32:30,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:30,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 104 [2023-11-29 01:32:30,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:30,163 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 122 [2023-11-29 01:32:30,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:30,231 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 116 [2023-11-29 01:32:30,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:30,247 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 134 [2023-11-29 01:32:30,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:30,313 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 116 [2023-11-29 01:32:30,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:30,329 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 138 [2023-11-29 01:32:30,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:30,390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2023-11-29 01:32:30,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:30,406 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2023-11-29 01:32:30,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:30,463 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 108 [2023-11-29 01:32:30,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:30,485 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 93 [2023-11-29 01:32:30,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:30,586 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 108 [2023-11-29 01:32:30,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:30,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 93 [2023-11-29 01:32:30,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:30,711 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 109 [2023-11-29 01:32:30,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:30,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 94 [2023-11-29 01:32:30,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:30,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 103 [2023-11-29 01:32:30,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:30,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 93 [2023-11-29 01:32:30,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:30,944 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 126 [2023-11-29 01:32:30,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:30,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 106 [2023-11-29 01:32:31,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:31,053 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2023-11-29 01:32:31,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:31,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2023-11-29 01:32:31,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:31,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2023-11-29 01:32:31,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:31,144 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 64 [2023-11-29 01:32:31,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:31,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 116 [2023-11-29 01:32:31,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:31,222 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 134 [2023-11-29 01:32:31,399 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_39 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_39 .cse2))) (let ((.cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) .cse1 v_ArrVal_516))) (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_39) .cse1 v_ArrVal_517) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) (or (= .cse0 (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse0) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse1) (not (= (select v_arrayElimArr_38 .cse2) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| .cse1))))))) (forall ((v_arrayElimArr_42 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_43 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select v_arrayElimArr_43 .cse2))) (or (not (= (select |c_#valid| .cse5) (_ bv0 1))) (not (= (_ bv0 32) (select v_arrayElimArr_42 .cse2))) (= (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_42) .cse5 v_ArrVal_516))) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_43) .cse5 v_ArrVal_517) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (bvadd (_ bv4 32) (select (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (_ bv0 32)) (= .cse5 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_15 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select v_arrayElimArr_14 .cse2))) (or (not (= (select |c_#valid| .cse7) (_ bv0 1))) (= .cse7 (select (let ((.cse8 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse7 v_ArrVal_517))) (select (store .cse8 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) (select (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_15) .cse7 v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (= .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 32) (select v_arrayElimArr_15 .cse2)))))) (forall ((v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select v_arrayElimArr_37 .cse2))) (let ((.cse9 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_36) .cse12 v_ArrVal_516)) (.cse13 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse12 v_ArrVal_517))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse11 (bvadd (_ bv4 32) (select (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (or (not (= (select v_arrayElimArr_36 .cse2) (_ bv0 32))) (= (select (select (store .cse9 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) .cse10) .cse11) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse10) .cse11))) (not (= (_ bv0 1) (select |c_#valid| .cse12)))))))) (forall ((v_arrayElimArr_47 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_46 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select v_arrayElimArr_46 .cse2))) (let ((.cse17 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_46) .cse16 v_ArrVal_517))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse14 (select (select (store .cse17 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse15) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_47) .cse16 v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse14) (not (= .cse15 .cse14)) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse16) (not (= (select |c_#valid| .cse16) (_ bv0 1))) (not (= (select v_arrayElimArr_47 .cse2) (_ bv0 32))))))))) (or (and (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select v_arrayElimArr_19 .cse2))) (let ((.cse18 (let ((.cse20 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_18) .cse19 v_ArrVal_516))) (select (select (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_19) .cse19 v_ArrVal_517) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (bvadd (_ bv4 32) (select (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) (or (= (_ bv0 32) .cse18) (not (= (select |c_#valid| .cse19) (_ bv0 1))) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse18) (not (= (select v_arrayElimArr_18 .cse2) (_ bv0 32))))))) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select v_arrayElimArr_17 .cse2))) (let ((.cse25 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_16) .cse21 v_ArrVal_516)) (.cse22 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse21 v_ArrVal_517))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse24 (bvadd (select (select .cse25 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv4 32)))) (or (not (= (_ bv0 1) (select |c_#valid| .cse21))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store .cse22 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse23) .cse24))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store .cse25 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) .cse23) .cse24)) (not (= (select v_arrayElimArr_16 .cse2) (_ bv0 32)))))))) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (select v_arrayElimArr_26 .cse2))) (let ((.cse29 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_26) .cse26 v_ArrVal_517))) (let ((.cse28 (select (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse27 (select (select (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse28) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_27) .cse26 v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (or (not (= (select v_arrayElimArr_27 .cse2) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| .cse26))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse27) (not (= .cse28 .cse27)))))))) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (select v_arrayElimArr_33 .cse2))) (let ((.cse30 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_32) .cse33 v_ArrVal_516)) (.cse34 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_33) .cse33 v_ArrVal_517))) (let ((.cse31 (select (select .cse34 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse32 (bvadd (_ bv4 32) (select (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (or (= (select (select (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) .cse31) .cse32) (_ bv0 32)) (not (= (select |c_#valid| .cse33) (_ bv0 1))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store .cse34 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse31) .cse32)) (not (= (select v_arrayElimArr_32 .cse2) (_ bv0 32)))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (select v_arrayElimArr_28 .cse2))) (let ((.cse38 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_28) .cse37 v_ArrVal_517))) (let ((.cse36 (select (select .cse38 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse35 (select (select (store .cse38 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse36) (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse37 v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv4 32))))) (or (not (= .cse35 .cse36)) (= .cse37 .cse35) (not (= (select v_arrayElimArr_29 .cse2) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| .cse37))))))))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_31 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (select v_arrayElimArr_31 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse39))) (not (= (select v_arrayElimArr_30 .cse2) (_ bv0 32))) (= (let ((.cse40 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse39 v_ArrVal_516))) (select (select (store .cse40 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) .cse39 v_ArrVal_517) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (bvadd (_ bv4 32) (select (select .cse40 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (_ bv0 32))))) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_23 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (select v_arrayElimArr_22 .cse2))) (or (not (= (select v_arrayElimArr_23 .cse2) (_ bv0 32))) (= (select (let ((.cse41 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_22) .cse42 v_ArrVal_517))) (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) (select (select .cse41 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) .cse42 v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) .cse42) (not (= (_ bv0 1) (select |c_#valid| .cse42)))))) (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (select v_arrayElimArr_21 .cse2))) (let ((.cse47 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_20) .cse46 v_ArrVal_516)) (.cse43 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_21) .cse46 v_ArrVal_517))) (let ((.cse44 (select (select .cse43 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse45 (bvadd (_ bv4 32) (select (select .cse47 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (or (not (= (select v_arrayElimArr_20 .cse2) (_ bv0 32))) (not (= (select (select (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse44) .cse45) .cse44)) (not (= (_ bv0 1) (select |c_#valid| .cse46))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store .cse47 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) .cse44) .cse45))))))) (forall ((v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (select v_arrayElimArr_24 .cse2))) (let ((.cse48 (select (let ((.cse50 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse49 v_ArrVal_517))) (select (store .cse50 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) (select (select .cse50 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse49 v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (or (not (= (select v_arrayElimArr_25 .cse2) (_ bv0 32))) (not (= .cse48 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse48 .cse49) (not (= (_ bv0 1) (select |c_#valid| .cse49)))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32))) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse51 (select v_arrayElimArr_12 .cse2))) (let ((.cse54 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse51 v_ArrVal_517))) (let ((.cse52 (select (select .cse54 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse53 (select (select (store .cse54 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse52) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse51 v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse51) (not (= (select v_arrayElimArr_13 .cse2) (_ bv0 32))) (not (= .cse52 .cse53)) (not (= (_ bv0 1) (select |c_#valid| .cse51))) (= .cse51 .cse53))))))) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (select v_arrayElimArr_35 .cse2))) (let ((.cse59 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse58 v_ArrVal_516)) (.cse55 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_35) .cse58 v_ArrVal_517))) (let ((.cse56 (select (select .cse55 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse57 (bvadd (_ bv4 32) (select (select .cse59 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store .cse55 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse56) .cse57)) (not (= (select v_arrayElimArr_34 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse58) (not (= (_ bv0 1) (select |c_#valid| .cse58))) (= (select (select (store .cse59 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) .cse56) .cse57) (_ bv0 32))))))) (forall ((v_arrayElimArr_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (select v_arrayElimArr_41 .cse2))) (let ((.cse64 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_40) .cse63 v_ArrVal_516)) (.cse61 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_41) .cse63 v_ArrVal_517))) (let ((.cse60 (select (select .cse61 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse62 (bvadd (_ bv4 32) (select (select .cse64 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (or (not (= .cse60 (select (select (store .cse61 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse60) .cse62))) (not (= (_ bv0 1) (select |c_#valid| .cse63))) (not (= (select v_arrayElimArr_40 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store .cse64 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) .cse60) .cse62)) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse63)))))) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_44 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_45 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (select v_arrayElimArr_44 .cse2))) (or (not (= (select |c_#valid| .cse65) (_ bv0 1))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse65) (not (= (_ bv0 32) (select v_arrayElimArr_45 .cse2))) (not (= (select (let ((.cse66 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_44) .cse65 v_ArrVal_517))) (select (store .cse66 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) (select (select .cse66 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_45) .cse65 v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|))))))) is different from false [2023-11-29 01:32:35,416 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_39 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_39 .cse2))) (let ((.cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) .cse1 v_ArrVal_516))) (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_39) .cse1 v_ArrVal_517) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) (or (= .cse0 (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse0) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse1) (not (= (select v_arrayElimArr_38 .cse2) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| .cse1))))))) (forall ((v_arrayElimArr_42 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_43 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select v_arrayElimArr_43 .cse2))) (or (not (= (select |c_#valid| .cse5) (_ bv0 1))) (not (= (_ bv0 32) (select v_arrayElimArr_42 .cse2))) (= (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_42) .cse5 v_ArrVal_516))) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_43) .cse5 v_ArrVal_517) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (bvadd (_ bv4 32) (select (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (_ bv0 32)) (= .cse5 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_15 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select v_arrayElimArr_14 .cse2))) (or (not (= (select |c_#valid| .cse7) (_ bv0 1))) (= .cse7 (select (let ((.cse8 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse7 v_ArrVal_517))) (select (store .cse8 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) (select (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_15) .cse7 v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (= .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (_ bv0 32) (select v_arrayElimArr_15 .cse2)))))) (forall ((v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select v_arrayElimArr_37 .cse2))) (let ((.cse9 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_36) .cse12 v_ArrVal_516)) (.cse13 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse12 v_ArrVal_517))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse11 (bvadd (_ bv4 32) (select (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (or (not (= (select v_arrayElimArr_36 .cse2) (_ bv0 32))) (= (select (select (store .cse9 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) .cse10) .cse11) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse10) .cse11))) (not (= (_ bv0 1) (select |c_#valid| .cse12)))))))) (forall ((v_arrayElimArr_47 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_46 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select v_arrayElimArr_46 .cse2))) (let ((.cse17 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_46) .cse16 v_ArrVal_517))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse14 (select (select (store .cse17 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse15) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_47) .cse16 v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse14) (not (= .cse15 .cse14)) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse16) (not (= (select |c_#valid| .cse16) (_ bv0 1))) (not (= (select v_arrayElimArr_47 .cse2) (_ bv0 32))))))))) (or (and (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select v_arrayElimArr_19 .cse2))) (let ((.cse18 (let ((.cse20 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_18) .cse19 v_ArrVal_516))) (select (select (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_19) .cse19 v_ArrVal_517) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (bvadd (_ bv4 32) (select (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) (or (= (_ bv0 32) .cse18) (not (= (select |c_#valid| .cse19) (_ bv0 1))) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse18) (not (= (select v_arrayElimArr_18 .cse2) (_ bv0 32))))))) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select v_arrayElimArr_17 .cse2))) (let ((.cse25 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_16) .cse21 v_ArrVal_516)) (.cse22 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse21 v_ArrVal_517))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse24 (bvadd (select (select .cse25 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv4 32)))) (or (not (= (_ bv0 1) (select |c_#valid| .cse21))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store .cse22 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse23) .cse24))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store .cse25 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) .cse23) .cse24)) (not (= (select v_arrayElimArr_16 .cse2) (_ bv0 32)))))))) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (select v_arrayElimArr_26 .cse2))) (let ((.cse29 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_26) .cse26 v_ArrVal_517))) (let ((.cse28 (select (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse27 (select (select (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse28) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_27) .cse26 v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (or (not (= (select v_arrayElimArr_27 .cse2) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| .cse26))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse27) (not (= .cse28 .cse27)))))))) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (select v_arrayElimArr_33 .cse2))) (let ((.cse30 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_32) .cse33 v_ArrVal_516)) (.cse34 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_33) .cse33 v_ArrVal_517))) (let ((.cse31 (select (select .cse34 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse32 (bvadd (_ bv4 32) (select (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (or (= (select (select (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) .cse31) .cse32) (_ bv0 32)) (not (= (select |c_#valid| .cse33) (_ bv0 1))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store .cse34 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse31) .cse32)) (not (= (select v_arrayElimArr_32 .cse2) (_ bv0 32)))))))) (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (select v_arrayElimArr_28 .cse2))) (let ((.cse38 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_28) .cse37 v_ArrVal_517))) (let ((.cse36 (select (select .cse38 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse35 (select (select (store .cse38 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse36) (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse37 v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (_ bv4 32))))) (or (not (= .cse35 .cse36)) (= .cse37 .cse35) (not (= (select v_arrayElimArr_29 .cse2) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| .cse37))))))))) (forall ((v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_31 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (select v_arrayElimArr_31 .cse2))) (or (not (= (_ bv0 1) (select |c_#valid| .cse39))) (not (= (select v_arrayElimArr_30 .cse2) (_ bv0 32))) (= (let ((.cse40 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse39 v_ArrVal_516))) (select (select (store .cse40 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) .cse39 v_ArrVal_517) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (bvadd (_ bv4 32) (select (select .cse40 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (_ bv0 32))))) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_23 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (select v_arrayElimArr_22 .cse2))) (or (not (= (select v_arrayElimArr_23 .cse2) (_ bv0 32))) (= (select (let ((.cse41 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_22) .cse42 v_ArrVal_517))) (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) (select (select .cse41 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) .cse42 v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) .cse42) (not (= (_ bv0 1) (select |c_#valid| .cse42)))))) (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (select v_arrayElimArr_21 .cse2))) (let ((.cse47 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_20) .cse46 v_ArrVal_516)) (.cse43 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_21) .cse46 v_ArrVal_517))) (let ((.cse44 (select (select .cse43 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse45 (bvadd (_ bv4 32) (select (select .cse47 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (or (not (= (select v_arrayElimArr_20 .cse2) (_ bv0 32))) (not (= (select (select (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse44) .cse45) .cse44)) (not (= (_ bv0 1) (select |c_#valid| .cse46))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store .cse47 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) .cse44) .cse45))))))) (forall ((v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (select v_arrayElimArr_24 .cse2))) (let ((.cse48 (select (let ((.cse50 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse49 v_ArrVal_517))) (select (store .cse50 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) (select (select .cse50 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse49 v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (or (not (= (select v_arrayElimArr_25 .cse2) (_ bv0 32))) (not (= .cse48 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse48 .cse49) (not (= (_ bv0 1) (select |c_#valid| .cse49)))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32))) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse51 (select v_arrayElimArr_12 .cse2))) (let ((.cse54 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse51 v_ArrVal_517))) (let ((.cse52 (select (select .cse54 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse53 (select (select (store .cse54 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse52) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse51 v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse51) (not (= (select v_arrayElimArr_13 .cse2) (_ bv0 32))) (not (= .cse52 .cse53)) (not (= (_ bv0 1) (select |c_#valid| .cse51))) (= .cse51 .cse53))))))) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (select v_arrayElimArr_35 .cse2))) (let ((.cse59 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse58 v_ArrVal_516)) (.cse55 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_35) .cse58 v_ArrVal_517))) (let ((.cse56 (select (select .cse55 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse57 (bvadd (_ bv4 32) (select (select .cse59 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store .cse55 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse56) .cse57)) (not (= (select v_arrayElimArr_34 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse58) (not (= (_ bv0 1) (select |c_#valid| .cse58))) (= (select (select (store .cse59 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) .cse56) .cse57) (_ bv0 32))))))) (forall ((v_arrayElimArr_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (select v_arrayElimArr_41 .cse2))) (let ((.cse64 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_40) .cse63 v_ArrVal_516)) (.cse61 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_41) .cse63 v_ArrVal_517))) (let ((.cse60 (select (select .cse61 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse62 (bvadd (_ bv4 32) (select (select .cse64 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (or (not (= .cse60 (select (select (store .cse61 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) .cse60) .cse62))) (not (= (_ bv0 1) (select |c_#valid| .cse63))) (not (= (select v_arrayElimArr_40 .cse2) (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store .cse64 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) .cse60) .cse62)) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse63)))))) (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_44 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_45 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (select v_arrayElimArr_44 .cse2))) (or (not (= (select |c_#valid| .cse65) (_ bv0 1))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse65) (not (= (_ bv0 32) (select v_arrayElimArr_45 .cse2))) (not (= (select (let ((.cse66 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_44) .cse65 v_ArrVal_517))) (select (store .cse66 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_519) (select (select .cse66 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_45) .cse65 v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|))))))) is different from true [2023-11-29 01:32:38,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:38,315 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 88 treesize of output 79 [2023-11-29 01:32:38,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:38,343 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 68 treesize of output 69 [2023-11-29 01:32:38,352 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:32:38,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:38,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 3070 treesize of output 2619 [2023-11-29 01:32:38,803 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:32:38,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:38,886 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 2552 treesize of output 2383 [2023-11-29 01:32:39,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:39,022 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 2376 treesize of output 2264 [2023-11-29 01:32:39,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:39,161 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 1069 treesize of output 1022 [2023-11-29 01:32:39,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:39,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2092 treesize of output 1988 [2023-11-29 01:32:39,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:39,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2065 treesize of output 1421 [2023-11-29 01:32:54,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:54,219 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 196 treesize of output 176 [2023-11-29 01:32:54,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:54,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 136 [2023-11-29 01:32:54,268 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:32:54,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:54,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 906 treesize of output 851 [2023-11-29 01:32:54,667 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:32:56,643 INFO L349 Elim1Store]: treesize reduction 42, result has 82.1 percent of original size [2023-11-29 01:32:56,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 5170 treesize of output 4597 [2023-11-29 01:32:57,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:57,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1004 treesize of output 960 [2023-11-29 01:32:57,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:57,272 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 362 treesize of output 355 [2023-11-29 01:32:57,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:57,389 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 346 treesize of output 347 [2023-11-29 01:32:57,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:57,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 845 treesize of output 637 [2023-11-29 01:32:57,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:57,913 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 222 treesize of output 214 [2023-11-29 01:32:58,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:58,033 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 206 treesize of output 206 [2023-11-29 01:33:25,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:33:25,491 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 169 treesize of output 149 [2023-11-29 01:33:25,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:33:25,524 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 139 treesize of output 119 [2023-11-29 01:33:25,542 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:33:25,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:33:25,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 7423 treesize of output 6794 [2023-11-29 01:33:25,978 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:33:27,872 INFO L349 Elim1Store]: treesize reduction 38, result has 82.6 percent of original size [2023-11-29 01:33:27,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 2211 treesize of output 1976 [2023-11-29 01:33:28,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:33:28,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 968 treesize of output 792 [2023-11-29 01:33:28,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:33:28,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 624 treesize of output 572 [2023-11-29 01:33:29,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:33:29,052 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 234 treesize of output 232 [2023-11-29 01:33:29,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:33:29,174 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 222 treesize of output 208 [2023-11-29 01:33:29,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:33:29,293 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 234 treesize of output 220 [2023-11-29 01:33:29,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:33:29,413 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 210 treesize of output 208 [2023-11-29 01:34:04,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:04,296 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 84 treesize of output 75 [2023-11-29 01:34:04,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:04,328 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 64 treesize of output 65 [2023-11-29 01:34:04,345 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:34:04,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:04,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 868 treesize of output 917 [2023-11-29 01:34:04,716 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:34:04,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:04,803 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 1144 treesize of output 957 [2023-11-29 01:34:04,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:04,928 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 507 treesize of output 403 [2023-11-29 01:34:05,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:05,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 358 treesize of output 366 [2023-11-29 01:34:05,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:05,350 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 234 treesize of output 220 [2023-11-29 01:34:05,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:05,435 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 210 treesize of output 208 [2023-11-29 01:34:16,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:16,924 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 196 treesize of output 156 [2023-11-29 01:34:16,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:16,956 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 146 treesize of output 136 [2023-11-29 01:34:16,976 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:34:17,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:17,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 6734 treesize of output 5503 [2023-11-29 01:34:17,540 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:34:17,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:17,635 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 4605 treesize of output 4226 [2023-11-29 01:34:17,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:17,852 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 3515 treesize of output 3327 [2023-11-29 01:34:18,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:18,023 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 3211 treesize of output 3115 [2023-11-29 01:34:18,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:18,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 3107 treesize of output 2915 [2023-11-29 01:34:18,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:18,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2992 treesize of output 2492 [2023-11-29 01:34:35,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:35,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 76 [2023-11-29 01:34:35,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:35,773 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 65 treesize of output 66 [2023-11-29 01:34:35,792 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:34:36,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:36,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 5619 treesize of output 4568 [2023-11-29 01:34:36,279 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:34:36,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:36,366 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 2225 treesize of output 2080 [2023-11-29 01:34:36,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:36,492 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 2073 treesize of output 1977 [2023-11-29 01:34:36,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:36,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1946 treesize of output 1646 [2023-11-29 01:34:36,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:36,960 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 1532 treesize of output 1477 [2023-11-29 01:34:37,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:37,061 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 1468 treesize of output 1389 [2023-11-29 01:34:44,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:44,759 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 200 treesize of output 160 [2023-11-29 01:34:44,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:44,789 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 150 treesize of output 140 [2023-11-29 01:34:44,807 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:34:45,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:45,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 3436 treesize of output 2901 [2023-11-29 01:34:45,290 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:34:45,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:45,384 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 2897 treesize of output 2674 [2023-11-29 01:34:45,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:45,553 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 2227 treesize of output 2119 [2023-11-29 01:34:45,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:45,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2088 treesize of output 1652 [2023-11-29 01:34:46,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:46,024 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 1539 treesize of output 1435 [2023-11-29 01:34:46,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:34:46,132 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 1427 treesize of output 1379 [2023-11-29 01:35:06,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:35:06,728 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 84 treesize of output 75 [2023-11-29 01:35:06,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:35:06,763 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 64 treesize of output 65 [2023-11-29 01:35:07,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:35:07,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 3712 treesize of output 3653 [2023-11-29 01:35:07,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:35:07,608 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 5800 treesize of output 5433 [2023-11-29 01:35:07,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:35:07,789 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 1404 treesize of output 1088 [2023-11-29 01:35:07,830 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 1074 treesize of output 914 [2023-11-29 01:35:08,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:35:08,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 728 treesize of output 694 [2023-11-29 01:35:08,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:35:08,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 664 treesize of output 700 [2023-11-29 01:35:09,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:35:09,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 438 treesize of output 430