./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/simple-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/simple-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB --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 a0d4825ef04f5689aff4ed3e5df593fedd83b7eb3ae072cea52c48718c9baf42 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:41:46,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:41:46,337 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 04:41:46,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:41:46,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:41:46,380 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:41:46,381 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:41:46,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:41:46,381 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:41:46,381 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:41:46,381 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:41:46,382 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:41:46,382 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:41:46,382 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:41:46,382 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:41:46,383 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:41:46,383 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 04:41:46,383 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:41:46,384 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:41:46,384 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:41:46,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:41:46,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 04:41:46,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:41:46,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 04:41:46,385 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:41:46,386 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 04:41:46,386 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:41:46,386 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:41:46,386 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:41:46,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:41:46,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:41:46,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:41:46,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:41:46,386 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:41:46,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:41:46,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:41:46,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:41:46,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:41:46,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:41:46,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:41:46,387 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 04:41:46,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 04:41:46,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:41:46,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:41:46,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:41:46,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:41:46,387 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:41:46,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:41:46,387 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> a0d4825ef04f5689aff4ed3e5df593fedd83b7eb3ae072cea52c48718c9baf42 [2024-11-28 04:41:46,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:41:46,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:41:46,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:41:46,690 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:41:46,690 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:41:46,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-properties/simple-2.i [2024-11-28 04:41:49,758 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/data/1810e75ec/d1726501b2cd4e039e5cfcc2b1bdab71/FLAG767f1faf1 [2024-11-28 04:41:50,121 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:41:50,123 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/sv-benchmarks/c/list-properties/simple-2.i [2024-11-28 04:41:50,141 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/data/1810e75ec/d1726501b2cd4e039e5cfcc2b1bdab71/FLAG767f1faf1 [2024-11-28 04:41:50,328 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/data/1810e75ec/d1726501b2cd4e039e5cfcc2b1bdab71 [2024-11-28 04:41:50,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:41:50,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:41:50,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:41:50,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:41:50,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:41:50,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:41:50" (1/1) ... [2024-11-28 04:41:50,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6738dc2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:50, skipping insertion in model container [2024-11-28 04:41:50,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:41:50" (1/1) ... [2024-11-28 04:41:50,367 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:41:50,708 WARN L250 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_845e52fd-826a-4f47-b980-8ce39ba565b2/sv-benchmarks/c/list-properties/simple-2.i[23225,23238] [2024-11-28 04:41:50,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:41:50,725 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:41:50,769 WARN L250 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_845e52fd-826a-4f47-b980-8ce39ba565b2/sv-benchmarks/c/list-properties/simple-2.i[23225,23238] [2024-11-28 04:41:50,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:41:50,812 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:41:50,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:50 WrapperNode [2024-11-28 04:41:50,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:41:50,815 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:41:50,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:41:50,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:41:50,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:50" (1/1) ... [2024-11-28 04:41:50,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:50" (1/1) ... [2024-11-28 04:41:50,866 INFO L138 Inliner]: procedures = 124, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 50 [2024-11-28 04:41:50,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:41:50,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:41:50,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:41:50,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:41:50,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:50" (1/1) ... [2024-11-28 04:41:50,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:50" (1/1) ... [2024-11-28 04:41:50,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:50" (1/1) ... [2024-11-28 04:41:50,900 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-11-28 04:41:50,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:50" (1/1) ... [2024-11-28 04:41:50,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:50" (1/1) ... [2024-11-28 04:41:50,906 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:50" (1/1) ... [2024-11-28 04:41:50,911 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:50" (1/1) ... [2024-11-28 04:41:50,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:50" (1/1) ... [2024-11-28 04:41:50,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:50" (1/1) ... [2024-11-28 04:41:50,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:50" (1/1) ... [2024-11-28 04:41:50,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:41:50,925 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:41:50,925 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:41:50,925 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:41:50,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:50" (1/1) ... [2024-11-28 04:41:50,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:41:50,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:41:50,959 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:41:50,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:41:50,987 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-28 04:41:50,988 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-28 04:41:50,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 04:41:50,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 04:41:50,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 04:41:50,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 04:41:50,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 04:41:50,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:41:50,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 04:41:50,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 04:41:50,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 04:41:50,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 04:41:50,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 04:41:50,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 04:41:50,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:41:50,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:41:51,090 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:41:51,092 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:41:51,114 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-28 04:41:51,233 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-28 04:41:51,234 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:41:51,243 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:41:51,243 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 04:41:51,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:41:51 BoogieIcfgContainer [2024-11-28 04:41:51,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:41:51,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:41:51,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:41:51,254 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:41:51,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:41:50" (1/3) ... [2024-11-28 04:41:51,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b1d96e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:41:51, skipping insertion in model container [2024-11-28 04:41:51,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:41:50" (2/3) ... [2024-11-28 04:41:51,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b1d96e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:41:51, skipping insertion in model container [2024-11-28 04:41:51,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:41:51" (3/3) ... [2024-11-28 04:41:51,258 INFO L128 eAbstractionObserver]: Analyzing ICFG simple-2.i [2024-11-28 04:41:51,278 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:41:51,281 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG simple-2.i that has 2 procedures, 25 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-28 04:41:51,336 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:41:51,348 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@37bb7fc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:41:51,349 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 04:41:51,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 20 states have (on average 1.4) internal successors, (28), 22 states have internal predecessors, (28), 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) [2024-11-28 04:41:51,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 04:41:51,359 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:41:51,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:41:51,361 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:41:51,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:41:51,365 INFO L85 PathProgramCache]: Analyzing trace with hash 129654765, now seen corresponding path program 1 times [2024-11-28 04:41:51,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:41:51,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753615212] [2024-11-28 04:41:51,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:41:51,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:41:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:41:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:41:51,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:41:51,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753615212] [2024-11-28 04:41:51,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753615212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:41:51,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:41:51,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:41:51,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832306704] [2024-11-28 04:41:51,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:41:51,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 04:41:51,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:41:51,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 04:41:51,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 04:41:51,575 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.4) internal successors, (28), 22 states have internal predecessors, (28), 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.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:41:51,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:41:51,592 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-28 04:41:51,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 04:41:51,594 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-28 04:41:51,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:41:51,599 INFO L225 Difference]: With dead ends: 35 [2024-11-28 04:41:51,599 INFO L226 Difference]: Without dead ends: 16 [2024-11-28 04:41:51,603 INFO L434 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 [2024-11-28 04:41:51,606 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:41:51,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:41:51,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-28 04:41:51,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-28 04:41:51,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:41:51,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-11-28 04:41:51,643 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 10 [2024-11-28 04:41:51,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:41:51,643 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-28 04:41:51,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:41:51,644 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-11-28 04:41:51,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 04:41:51,645 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:41:51,645 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:41:51,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 04:41:51,645 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:41:51,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:41:51,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1410165730, now seen corresponding path program 1 times [2024-11-28 04:41:51,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:41:51,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005398935] [2024-11-28 04:41:51,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:41:51,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:41:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:41:52,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:41:52,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:41:52,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005398935] [2024-11-28 04:41:52,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005398935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:41:52,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:41:52,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:41:52,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314210539] [2024-11-28 04:41:52,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:41:52,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:41:52,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:41:52,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:41:52,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:41:52,055 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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) [2024-11-28 04:41:52,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:41:52,166 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-11-28 04:41:52,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:41:52,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 [2024-11-28 04:41:52,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:41:52,168 INFO L225 Difference]: With dead ends: 28 [2024-11-28 04:41:52,168 INFO L226 Difference]: Without dead ends: 26 [2024-11-28 04:41:52,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:41:52,169 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:41:52,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 33 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:41:52,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-28 04:41:52,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2024-11-28 04:41:52,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:41:52,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-11-28 04:41:52,174 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 11 [2024-11-28 04:41:52,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:41:52,174 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-11-28 04:41:52,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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) [2024-11-28 04:41:52,175 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-11-28 04:41:52,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-28 04:41:52,175 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:41:52,175 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:41:52,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 04:41:52,175 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:41:52,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:41:52,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2125731432, now seen corresponding path program 1 times [2024-11-28 04:41:52,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:41:52,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984066155] [2024-11-28 04:41:52,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:41:52,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:41:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:41:52,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:41:52,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:41:52,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984066155] [2024-11-28 04:41:52,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984066155] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:41:52,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478330503] [2024-11-28 04:41:52,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:41:52,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:41:52,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:41:52,609 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:41:52,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:41:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:41:52,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 04:41:52,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:41:52,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:41:52,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:41:52,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:41:52,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:41:53,007 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 21 [2024-11-28 04:41:53,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:41:53,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:41:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:41:53,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478330503] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:41:53,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:41:53,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 8 [2024-11-28 04:41:53,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790141106] [2024-11-28 04:41:53,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:41:53,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 04:41:53,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:41:53,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 04:41:53,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:41:53,047 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:41:53,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:41:53,100 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-11-28 04:41:53,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:41:53,101 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-28 04:41:53,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:41:53,101 INFO L225 Difference]: With dead ends: 33 [2024-11-28 04:41:53,101 INFO L226 Difference]: Without dead ends: 21 [2024-11-28 04:41:53,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:41:53,102 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:41:53,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 37 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:41:53,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-28 04:41:53,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2024-11-28 04:41:53,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:41:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-28 04:41:53,109 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2024-11-28 04:41:53,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:41:53,109 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-28 04:41:53,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:41:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-28 04:41:53,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 04:41:53,111 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:41:53,111 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:41:53,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 04:41:53,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:41:53,312 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:41:53,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:41:53,313 INFO L85 PathProgramCache]: Analyzing trace with hash 963419155, now seen corresponding path program 1 times [2024-11-28 04:41:53,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:41:53,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785838842] [2024-11-28 04:41:53,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:41:53,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:41:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:41:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:41:53,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:41:53,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785838842] [2024-11-28 04:41:53,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785838842] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:41:53,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275553200] [2024-11-28 04:41:53,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:41:53,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:41:53,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:41:53,698 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:41:53,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:41:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:41:53,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-28 04:41:53,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:41:53,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:41:53,936 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:41:53,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:41:53,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:41:54,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 04:41:54,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 04:41:54,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:41:54,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:41:55,592 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_115 Int) (v_ArrVal_116 (Array Int Int))) (= (select (select (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|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_115)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_116) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2024-11-28 04:41:55,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:41:55,626 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 [2024-11-28 04:41:55,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:41:55,644 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 [2024-11-28 04:41:55,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-28 04:41:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:41:55,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275553200] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:41:55,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:41:55,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-11-28 04:41:55,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750553814] [2024-11-28 04:41:55,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:41:55,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 04:41:55,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:41:55,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 04:41:55,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=4, NotChecked=28, Total=272 [2024-11-28 04:41:55,791 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:41:56,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:41:56,015 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-11-28 04:41:56,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:41:56,016 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-28 04:41:56,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:41:56,017 INFO L225 Difference]: With dead ends: 33 [2024-11-28 04:41:56,017 INFO L226 Difference]: Without dead ends: 31 [2024-11-28 04:41:56,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=4, NotChecked=38, Total=462 [2024-11-28 04:41:56,018 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 25 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:41:56,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 56 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 97 Invalid, 0 Unknown, 27 Unchecked, 0.1s Time] [2024-11-28 04:41:56,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-28 04:41:56,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-28 04:41:56,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:41:56,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-11-28 04:41:56,022 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 16 [2024-11-28 04:41:56,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:41:56,023 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-11-28 04:41:56,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:41:56,023 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-11-28 04:41:56,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 04:41:56,023 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:41:56,023 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:41:56,033 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 04:41:56,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-28 04:41:56,228 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:41:56,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:41:56,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1135461913, now seen corresponding path program 1 times [2024-11-28 04:41:56,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:41:56,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642871585] [2024-11-28 04:41:56,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:41:56,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:41:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:41:56,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:41:56,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:41:56,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642871585] [2024-11-28 04:41:56,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642871585] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:41:56,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580057132] [2024-11-28 04:41:56,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:41:56,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:41:56,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:41:56,842 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:41:56,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 04:41:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:41:56,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-28 04:41:56,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:41:56,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:41:57,027 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:41:57,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:41:57,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 04:41:57,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 04:41:57,208 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:41:57,208 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 87 treesize of output 78 [2024-11-28 04:41:57,216 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 46 treesize of output 15 [2024-11-28 04:41:57,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2024-11-28 04:41:57,301 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 [2024-11-28 04:41:57,309 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 [2024-11-28 04:41:57,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:41:57,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:41:57,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:41:57,392 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 85 treesize of output 89 [2024-11-28 04:41:57,423 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 3 [2024-11-28 04:41:57,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 111 treesize of output 100 [2024-11-28 04:41:57,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:41:57,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-28 04:41:57,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:41:57,551 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 38 treesize of output 31 [2024-11-28 04:41:57,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:41:57,580 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-28 04:41:57,580 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 [2024-11-28 04:41:57,757 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:41:57,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580057132] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:41:57,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:41:57,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-11-28 04:41:57,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484100888] [2024-11-28 04:41:57,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:41:57,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 04:41:57,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:41:57,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 04:41:57,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=223, Unknown=5, NotChecked=0, Total=272 [2024-11-28 04:41:57,761 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:41:58,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:41:58,140 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2024-11-28 04:41:58,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 04:41:58,140 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-28 04:41:58,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:41:58,141 INFO L225 Difference]: With dead ends: 37 [2024-11-28 04:41:58,141 INFO L226 Difference]: Without dead ends: 35 [2024-11-28 04:41:58,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=413, Unknown=7, NotChecked=0, Total=506 [2024-11-28 04:41:58,142 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 32 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:41:58,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 105 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:41:58,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-28 04:41:58,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2024-11-28 04:41:58,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:41:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2024-11-28 04:41:58,147 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2024-11-28 04:41:58,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:41:58,147 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2024-11-28 04:41:58,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:41:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2024-11-28 04:41:58,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-28 04:41:58,148 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:41:58,148 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:41:58,158 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 04:41:58,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:41:58,349 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:41:58,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:41:58,349 INFO L85 PathProgramCache]: Analyzing trace with hash 329835138, now seen corresponding path program 2 times [2024-11-28 04:41:58,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:41:58,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577362614] [2024-11-28 04:41:58,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:41:58,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:41:58,375 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:41:58,375 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:41:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:41:58,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:41:58,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577362614] [2024-11-28 04:41:58,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577362614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:41:58,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781957723] [2024-11-28 04:41:58,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:41:58,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:41:58,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:41:58,896 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:41:58,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 04:41:59,003 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:41:59,003 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:41:59,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-28 04:41:59,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:41:59,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:41:59,080 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:41:59,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:41:59,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:41:59,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 04:41:59,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 04:41:59,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 04:41:59,280 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-28 04:41:59,281 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 26 treesize of output 18 [2024-11-28 04:41:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:41:59,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:41:59,367 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_273 (Array Int Int))) (or (not (= v_ArrVal_273 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (store (select |c_#memory_int#1| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 1) .cse0 (select v_ArrVal_273 .cse0))))) (= (select (select (store |c_#memory_int#1| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_273) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2024-11-28 04:41:59,404 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_270 (Array Int Int)) (v_ArrVal_273 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_37| Int)) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_270))) (or (= (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_37| v_ArrVal_273) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_273 (let ((.cse1 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (store (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_37|) |c_ULTIMATE.start_main_~t~0#1.offset| 1) .cse1 (select v_ArrVal_273 .cse1)))))))) is different from false [2024-11-28 04:41:59,443 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_270 (Array Int Int)) (v_ArrVal_273 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_37| Int)) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_270))) (or (not (= v_ArrVal_273 (store (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_37|) 0 1) 4 (select v_ArrVal_273 4)))) (= (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_37| v_ArrVal_273) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) is different from false [2024-11-28 04:41:59,483 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_266 Int) (v_ArrVal_270 (Array Int Int)) (v_ArrVal_273 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_37| Int)) (let ((.cse0 (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|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_266)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270))) (or (not (= v_ArrVal_273 (store (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_37|) 0 1) 4 (select v_ArrVal_273 4)))) (= (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_37| v_ArrVal_273) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) is different from false [2024-11-28 04:41:59,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:41:59,515 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 57 treesize of output 49 [2024-11-28 04:41:59,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:41:59,539 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 158 treesize of output 174 [2024-11-28 04:41:59,589 INFO L349 Elim1Store]: treesize reduction 26, result has 53.6 percent of original size [2024-11-28 04:41:59,589 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 60 treesize of output 79 [2024-11-28 04:41:59,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 04:41:59,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:41:59,794 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 70 treesize of output 80 [2024-11-28 04:42:00,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:00,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-28 04:42:00,116 INFO L349 Elim1Store]: treesize reduction 56, result has 53.7 percent of original size [2024-11-28 04:42:00,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 100 treesize of output 144 [2024-11-28 04:42:00,342 INFO L349 Elim1Store]: treesize reduction 16, result has 61.0 percent of original size [2024-11-28 04:42:00,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 57 [2024-11-28 04:42:00,433 INFO L349 Elim1Store]: treesize reduction 16, result has 61.0 percent of original size [2024-11-28 04:42:00,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 57 [2024-11-28 04:42:00,771 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 [2024-11-28 04:42:00,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 04:42:00,896 INFO L349 Elim1Store]: treesize reduction 52, result has 50.5 percent of original size [2024-11-28 04:42:00,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 91 [2024-11-28 04:42:01,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:01,283 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 29 treesize of output 39 [2024-11-28 04:42:01,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:01,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 176 treesize of output 176 [2024-11-28 04:42:02,011 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-28 04:42:02,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781957723] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:42:02,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:42:02,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2024-11-28 04:42:02,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383822877] [2024-11-28 04:42:02,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:42:02,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 04:42:02,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:02,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 04:42:02,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=170, Unknown=4, NotChecked=116, Total=342 [2024-11-28 04:42:02,013 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:02,375 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2024-11-28 04:42:02,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:42:02,375 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-28 04:42:02,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:02,376 INFO L225 Difference]: With dead ends: 46 [2024-11-28 04:42:02,376 INFO L226 Difference]: Without dead ends: 44 [2024-11-28 04:42:02,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=365, Unknown=4, NotChecked=172, Total=650 [2024-11-28 04:42:02,377 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 48 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:02,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 113 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 118 Invalid, 0 Unknown, 134 Unchecked, 0.2s Time] [2024-11-28 04:42:02,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-28 04:42:02,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2024-11-28 04:42:02,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:02,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-28 04:42:02,384 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 21 [2024-11-28 04:42:02,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:02,384 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-28 04:42:02,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:02,385 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-28 04:42:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-28 04:42:02,385 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:02,385 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:42:02,396 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 04:42:02,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:42:02,591 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:42:02,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:02,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1784775393, now seen corresponding path program 2 times [2024-11-28 04:42:02,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:02,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634673923] [2024-11-28 04:42:02,591 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:42:02,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:02,622 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:42:02,623 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:42:03,210 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:03,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:03,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634673923] [2024-11-28 04:42:03,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634673923] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:42:03,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807378611] [2024-11-28 04:42:03,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:42:03,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:42:03,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:42:03,213 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:42:03,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 04:42:03,306 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:42:03,306 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:42:03,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-28 04:42:03,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:42:03,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:42:03,378 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:42:03,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:42:03,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:42:03,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 04:42:03,491 INFO L349 Elim1Store]: treesize reduction 18, result has 21.7 percent of original size [2024-11-28 04:42:03,491 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 35 treesize of output 36 [2024-11-28 04:42:03,500 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 12 treesize of output 11 [2024-11-28 04:42:03,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2024-11-28 04:42:03,517 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 12 treesize of output 11 [2024-11-28 04:42:03,715 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:03,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:42:03,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:03,810 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 45 treesize of output 44 [2024-11-28 04:42:03,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:03,815 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 35 treesize of output 39 [2024-11-28 04:42:03,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:03,830 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 45 treesize of output 49 [2024-11-28 04:42:03,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:03,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2024-11-28 04:42:03,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:03,997 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 60 treesize of output 61 [2024-11-28 04:42:04,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:04,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2024-11-28 04:42:04,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:04,024 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 72 treesize of output 71 [2024-11-28 04:42:04,326 INFO L349 Elim1Store]: treesize reduction 42, result has 82.1 percent of original size [2024-11-28 04:42:04,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 208 treesize of output 335 [2024-11-28 04:42:04,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:04,362 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 137 treesize of output 109 [2024-11-28 04:42:04,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:04,436 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 146 treesize of output 166 [2024-11-28 04:42:14,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:14,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2024-11-28 04:42:14,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:14,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2024-11-28 04:42:14,139 INFO L349 Elim1Store]: treesize reduction 84, result has 25.0 percent of original size [2024-11-28 04:42:14,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 111 [2024-11-28 04:42:14,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:42:14,155 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 43 treesize of output 37 [2024-11-28 04:42:14,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:42:14,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:42:14,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 67 [2024-11-28 04:42:14,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-28 04:42:14,436 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:14,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807378611] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:42:14,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:42:14,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-11-28 04:42:14,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305779563] [2024-11-28 04:42:14,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:42:14,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 04:42:14,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:14,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 04:42:14,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=217, Unknown=11, NotChecked=0, Total=272 [2024-11-28 04:42:14,438 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:14,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:14,633 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2024-11-28 04:42:14,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:42:14,635 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-28 04:42:14,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:14,635 INFO L225 Difference]: With dead ends: 48 [2024-11-28 04:42:14,635 INFO L226 Difference]: Without dead ends: 32 [2024-11-28 04:42:14,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=272, Unknown=12, NotChecked=0, Total=342 [2024-11-28 04:42:14,636 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:14,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 99 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:42:14,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-28 04:42:14,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-28 04:42:14,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:14,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-11-28 04:42:14,640 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 24 [2024-11-28 04:42:14,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:14,640 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-11-28 04:42:14,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:14,640 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2024-11-28 04:42:14,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-28 04:42:14,641 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:14,641 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:42:14,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 04:42:14,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:42:14,841 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:42:14,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:14,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2139931384, now seen corresponding path program 3 times [2024-11-28 04:42:14,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:14,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068696040] [2024-11-28 04:42:14,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:42:14,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:14,874 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-28 04:42:14,874 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:42:15,790 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:15,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:15,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068696040] [2024-11-28 04:42:15,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068696040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:42:15,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901468031] [2024-11-28 04:42:15,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:42:15,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:42:15,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:42:15,793 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:42:15,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 04:42:15,907 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-28 04:42:15,907 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:42:15,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-28 04:42:15,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:42:15,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:42:15,977 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 04:42:15,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 04:42:16,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 04:42:16,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:42:16,175 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:42:16,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 04:42:16,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:42:16,212 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 04:42:16,213 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 [2024-11-28 04:42:16,236 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-28 04:42:16,237 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 [2024-11-28 04:42:16,347 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-28 04:42:16,347 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 132 treesize of output 82 [2024-11-28 04:42:16,359 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 [2024-11-28 04:42:16,370 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 39 treesize of output 15 [2024-11-28 04:42:16,482 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-28 04:42:16,483 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 123 treesize of output 86 [2024-11-28 04:42:16,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:42:16,496 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 [2024-11-28 04:42:16,505 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 36 treesize of output 15 [2024-11-28 04:42:16,592 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:42:16,592 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 58 treesize of output 33 [2024-11-28 04:42:16,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 04:42:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:16,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:42:16,668 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (v_ArrVal_433 (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_~p~0#1.base| v_ArrVal_436) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_433) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 04:42:20,689 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (v_ArrVal_430 Int) (v_ArrVal_433 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (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_430)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_436) (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|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_433) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store (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|) .cse0 |c_ULTIMATE.start_main_~t~0#1.offset|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 04:42:20,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:20,707 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 61 [2024-11-28 04:42:20,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:20,718 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 64 treesize of output 70 [2024-11-28 04:42:20,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:20,737 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 128 treesize of output 131 [2024-11-28 04:42:20,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:20,748 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 99 treesize of output 97 [2024-11-28 04:42:20,754 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 27 [2024-11-28 04:42:20,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-28 04:42:20,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-28 04:42:20,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-28 04:42:20,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:20,979 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 29 treesize of output 30 [2024-11-28 04:42:20,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:20,991 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 86 treesize of output 85 [2024-11-28 04:42:21,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:21,004 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 80 treesize of output 64 [2024-11-28 04:42:21,009 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 42 [2024-11-28 04:42:21,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:21,115 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 34 treesize of output 35 [2024-11-28 04:42:21,122 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:42:21,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:21,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2024-11-28 04:42:21,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:21,142 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 41 treesize of output 33 [2024-11-28 04:42:21,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:21,192 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 25 treesize of output 26 [2024-11-28 04:42:21,195 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:42:21,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:21,203 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 36 treesize of output 35 [2024-11-28 04:42:21,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:21,211 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 20 treesize of output 20 [2024-11-28 04:42:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-28 04:42:21,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901468031] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:42:21,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:42:21,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2024-11-28 04:42:21,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314500497] [2024-11-28 04:42:21,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:42:21,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-28 04:42:21,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:21,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-28 04:42:21,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=433, Unknown=3, NotChecked=86, Total=600 [2024-11-28 04:42:21,917 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 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) [2024-11-28 04:42:22,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:22,461 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2024-11-28 04:42:22,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 04:42:22,466 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 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 25 [2024-11-28 04:42:22,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:22,466 INFO L225 Difference]: With dead ends: 42 [2024-11-28 04:42:22,466 INFO L226 Difference]: Without dead ends: 40 [2024-11-28 04:42:22,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=133, Invalid=684, Unknown=3, NotChecked=110, Total=930 [2024-11-28 04:42:22,467 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:22,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 151 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 247 Invalid, 0 Unknown, 71 Unchecked, 0.3s Time] [2024-11-28 04:42:22,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-28 04:42:22,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2024-11-28 04:42:22,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:22,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2024-11-28 04:42:22,472 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 25 [2024-11-28 04:42:22,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:22,472 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-11-28 04:42:22,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 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) [2024-11-28 04:42:22,472 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2024-11-28 04:42:22,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 04:42:22,473 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:22,473 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:42:22,482 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 04:42:22,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:42:22,677 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:42:22,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:22,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1871858035, now seen corresponding path program 3 times [2024-11-28 04:42:22,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:22,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354262819] [2024-11-28 04:42:22,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:42:22,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:22,702 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-28 04:42:22,702 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:42:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:23,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:23,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354262819] [2024-11-28 04:42:23,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354262819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:42:23,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558108319] [2024-11-28 04:42:23,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:42:23,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:42:23,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:42:23,351 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:42:23,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 04:42:23,523 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-28 04:42:23,523 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:42:23,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-28 04:42:23,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:42:23,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:42:23,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:42:23,593 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:42:23,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:42:23,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 04:42:23,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-28 04:42:23,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 04:42:23,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 04:42:23,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 04:42:23,774 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-28 04:42:23,774 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 18 [2024-11-28 04:42:23,832 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 04:42:23,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-11-28 04:42:23,886 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-28 04:42:23,887 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 26 treesize of output 18 [2024-11-28 04:42:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:42:23,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:42:23,948 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_561 (Array Int Int))) (or (= (select (select (store |c_#memory_int#1| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_561) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (store (select |c_#memory_int#1| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 1) .cse0 (select v_ArrVal_561 .cse0))) v_ArrVal_561)))) is different from false [2024-11-28 04:42:23,976 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_557 Int)) (let ((.cse0 (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|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_557)))) (or (not (= v_ArrVal_561 (let ((.cse1 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (store (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_66|) |c_ULTIMATE.start_main_~t~0#1.offset| 1) .cse1 (select v_ArrVal_561 .cse1))))) (= (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_561) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) is different from false [2024-11-28 04:42:24,002 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (|v_ULTIMATE.start_main_~p~0#1.base_66| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_557 Int)) (let ((.cse0 (store |c_#memory_int#1| |ULTIMATE.start_main_~p~0#1.base| (store (store (select |c_#memory_int#1| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 1) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_557)))) (or (= (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_561) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_561 (store (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_66|) 0 1) 4 (select v_ArrVal_561 4))))))) is different from false [2024-11-28 04:42:24,040 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| Int) (|v_ULTIMATE.start_main_~p~0#1.base_67| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_557 Int)) (let ((.cse0 (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_555))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67| (store (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67|) |c_ULTIMATE.start_main_~t~0#1.offset| 1) (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4) v_ArrVal_557))))) (or (not (= v_ArrVal_561 (store (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_66|) 0 1) 4 (select v_ArrVal_561 4)))) (= 1 (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_561) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2024-11-28 04:42:24,072 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_66| Int) (|v_ULTIMATE.start_main_~p~0#1.base_67| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_557 Int)) (let ((.cse0 (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_555))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67| (store (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67|) 0 1) 4 v_ArrVal_557))))) (or (not (= (store (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_66|) 0 1) 4 (select v_ArrVal_561 4)) v_ArrVal_561)) (= (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_561) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) is different from false [2024-11-28 04:42:24,130 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 Int) (|v_ULTIMATE.start_main_~p~0#1.base_66| Int) (|v_ULTIMATE.start_main_~p~0#1.base_67| Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_557 Int)) (let ((.cse0 (let ((.cse1 (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|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_551)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_555))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67| (store (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67|) 0 1) 4 v_ArrVal_557))))) (or (= (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_66| v_ArrVal_561) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_561 (store (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_66|) 0 1) 4 (select v_ArrVal_561 4))))))) is different from false [2024-11-28 04:42:24,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:24,163 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 111 treesize of output 77 [2024-11-28 04:42:24,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:24,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 762 treesize of output 782 [2024-11-28 04:42:24,280 INFO L349 Elim1Store]: treesize reduction 26, result has 53.6 percent of original size [2024-11-28 04:42:24,281 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 478 treesize of output 467 [2024-11-28 04:42:24,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-28 04:42:24,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:24,503 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 30 treesize of output 40 [2024-11-28 04:42:24,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:24,620 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 30 treesize of output 40 [2024-11-28 04:42:24,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:24,712 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 30 treesize of output 40 [2024-11-28 04:42:25,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:25,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-28 04:42:25,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:25,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-28 04:42:25,386 INFO L349 Elim1Store]: treesize reduction 26, result has 53.6 percent of original size [2024-11-28 04:42:25,386 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 76 treesize of output 87 [2024-11-28 04:42:25,524 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-11-28 04:42:25,524 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 29 treesize of output 31 [2024-11-28 04:42:25,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:25,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-28 04:42:25,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:25,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-28 04:42:26,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:26,476 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 127 treesize of output 127 [2024-11-28 04:42:27,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:27,231 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 22 treesize of output 26 [2024-11-28 04:42:27,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:27,261 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 25 [2024-11-28 04:42:29,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:29,666 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 134 treesize of output 134 [2024-11-28 04:42:30,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:30,304 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 25 [2024-11-28 04:42:30,328 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 04:42:30,328 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 63 treesize of output 59 [2024-11-28 04:42:30,377 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 04:42:30,377 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 12 treesize of output 11 [2024-11-28 04:42:30,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:30,942 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 972 treesize of output 915 [2024-11-28 04:42:31,226 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:42:31,226 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:42:31,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2024-11-28 04:42:31,235 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:42:31,236 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:42:31,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2024-11-28 04:42:31,247 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:42:31,247 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:42:31,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2024-11-28 04:42:31,256 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:42:31,259 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 53 [2024-11-28 04:42:31,267 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:42:31,269 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-11-28 04:42:31,279 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-28 04:42:31,283 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:42:31,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-11-28 04:42:31,290 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:42:31,292 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-11-28 04:42:31,295 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:42:31,302 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-11-28 04:42:31,312 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-28 04:42:31,317 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-28 04:42:31,322 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:42:31,322 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:42:31,324 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 04:42:31,331 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-28 04:42:31,454 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2024-11-28 04:42:31,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558108319] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:42:31,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:42:31,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 25 [2024-11-28 04:42:31,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650448686] [2024-11-28 04:42:31,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:42:31,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-28 04:42:31,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:42:31,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-28 04:42:31,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=277, Unknown=6, NotChecked=234, Total=600 [2024-11-28 04:42:31,458 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 25 states, 25 states have (on average 2.48) internal successors, (62), 25 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) [2024-11-28 04:42:31,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:31,729 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2024-11-28 04:42:31,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:42:31,729 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.48) internal successors, (62), 25 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 26 [2024-11-28 04:42:31,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:31,730 INFO L225 Difference]: With dead ends: 42 [2024-11-28 04:42:31,730 INFO L226 Difference]: Without dead ends: 40 [2024-11-28 04:42:31,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=400, Unknown=6, NotChecked=282, Total=812 [2024-11-28 04:42:31,731 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:31,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 124 Unchecked, 0.1s Time] [2024-11-28 04:42:31,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-28 04:42:31,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2024-11-28 04:42:31,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:42:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2024-11-28 04:42:31,736 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2024-11-28 04:42:31,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:31,736 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-11-28 04:42:31,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.48) internal successors, (62), 25 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) [2024-11-28 04:42:31,736 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2024-11-28 04:42:31,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 04:42:31,737 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:31,737 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:42:31,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 04:42:31,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:42:31,942 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:42:31,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:31,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1944118414, now seen corresponding path program 4 times [2024-11-28 04:42:31,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:42:31,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893305795] [2024-11-28 04:42:31,943 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 04:42:31,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:42:31,979 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 04:42:31,980 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:42:32,834 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:32,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:42:32,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893305795] [2024-11-28 04:42:32,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893305795] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:42:32,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509070973] [2024-11-28 04:42:32,835 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 04:42:32,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:42:32,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:42:32,839 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:42:32,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 04:42:32,950 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 04:42:32,950 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:42:32,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-28 04:42:32,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:42:32,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:42:33,037 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 04:42:33,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 04:42:33,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:42:33,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 04:42:33,204 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 04:42:33,204 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 [2024-11-28 04:42:33,225 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-28 04:42:33,225 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 [2024-11-28 04:42:33,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:42:33,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 04:42:33,343 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-28 04:42:33,343 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 [2024-11-28 04:42:33,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:42:33,365 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 [2024-11-28 04:42:33,496 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-11-28 04:42:33,496 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 116 treesize of output 87 [2024-11-28 04:42:33,504 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 16 treesize of output 15 [2024-11-28 04:42:33,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:42:33,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2024-11-28 04:42:33,520 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 16 treesize of output 15 [2024-11-28 04:42:33,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2024-11-28 04:42:33,878 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-28 04:42:33,879 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 50 [2024-11-28 04:42:33,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:42:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:42:33,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:42:34,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:34,076 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 130 treesize of output 118 [2024-11-28 04:42:34,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:34,083 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 110 treesize of output 98 [2024-11-28 04:42:34,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:34,099 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 175 treesize of output 179 [2024-11-28 04:42:34,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 3 [2024-11-28 04:42:34,126 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 534 treesize of output 476 [2024-11-28 04:42:34,610 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse5 (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|) .cse12 |c_ULTIMATE.start_main_~t~0#1.offset|))) (.cse0 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) (.cse3 (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|) .cse12 |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((v_arrayElimArr_26 (Array Int Int))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_26) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_26 .cse0) 0)) (= |c_ULTIMATE.start_main_~t~0#1.base| (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_25))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse4 4))) (= .cse4 0)))) (not (= (select v_arrayElimArr_25 .cse0) 0)))) (forall ((v_arrayElimArr_25 (Array Int Int))) (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_25))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse6 0) (forall ((v_arrayElimArr_26 (Array Int Int))) (or (not (= (select v_arrayElimArr_26 .cse0) 0)) (= |c_ULTIMATE.start_main_~t~0#1.base| (select (select .cse7 .cse6) (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_26) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))))) (not (= (select v_arrayElimArr_25 .cse0) 0)))))) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (forall ((v_arrayElimArr_26 (Array Int Int))) (let ((.cse8 (store .cse5 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_26))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_26 .cse0) 0)) (= |c_ULTIMATE.start_main_~t~0#1.offset| (select (select .cse8 (select (select (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (+ .cse9 4))) (= .cse9 0))))) (not (= (select v_arrayElimArr_25 .cse0) 0)))) (forall ((v_arrayElimArr_25 (Array Int Int))) (let ((.cse10 (select (select (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse10 0) (forall ((v_arrayElimArr_26 (Array Int Int))) (or (not (= (select v_arrayElimArr_26 .cse0) 0)) (= |c_ULTIMATE.start_main_~t~0#1.offset| (let ((.cse11 (store .cse5 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_26))) (select (select .cse11 .cse10) (+ (select (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4)))))) (not (= (select v_arrayElimArr_25 .cse0) 0)))))))) is different from false [2024-11-28 04:42:34,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:34,710 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 349 treesize of output 318 [2024-11-28 04:42:34,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:34,724 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 381 treesize of output 350 [2024-11-28 04:42:35,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:35,384 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 81 treesize of output 82 [2024-11-28 04:42:35,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:35,393 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 101 treesize of output 81 [2024-11-28 04:42:35,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:35,411 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 420 treesize of output 413 [2024-11-28 04:42:36,348 INFO L349 Elim1Store]: treesize reduction 414, result has 57.9 percent of original size [2024-11-28 04:42:36,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 2675 treesize of output 2874 [2024-11-28 04:42:36,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:36,500 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 691 treesize of output 543 [2024-11-28 04:42:36,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:36,672 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 554 treesize of output 578 [2024-11-28 04:42:37,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:37,005 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 583 treesize of output 561 [2024-11-28 04:42:37,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:42:37,296 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 333 treesize of output 243 [2024-11-28 04:45:44,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-28 04:45:44,602 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-28 04:45:44,604 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-28 04:45:44,610 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 04:45:44,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-28 04:45:44,805 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_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/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:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) 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:590) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) 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:337) 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:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) 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:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) 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 [2024-11-28 04:45:44,811 INFO L158 Benchmark]: Toolchain (without parser) took 234479.82ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 91.4MB in the beginning and 767.7MB in the end (delta: -676.2MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-28 04:45:44,812 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:45:44,812 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.56ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 74.3MB in the end (delta: 17.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:45:44,812 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.82ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 72.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:45:44,812 INFO L158 Benchmark]: Boogie Preprocessor took 56.19ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 70.8MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:45:44,812 INFO L158 Benchmark]: RCFGBuilder took 318.95ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 59.2MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:45:44,813 INFO L158 Benchmark]: TraceAbstraction took 233562.94ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 58.7MB in the beginning and 767.7MB in the end (delta: -709.0MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-28 04:45:44,814 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.39ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.56ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 74.3MB in the end (delta: 17.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.82ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 72.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.19ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 70.8MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 318.95ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 59.2MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 233562.94ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 58.7MB in the beginning and 767.7MB in the end (delta: -709.0MB). Peak memory consumption was 1.0GB. 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_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/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_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/simple-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB --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 a0d4825ef04f5689aff4ed3e5df593fedd83b7eb3ae072cea52c48718c9baf42 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:45:47,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:45:47,611 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-28 04:45:47,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:45:47,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:45:47,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:45:47,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:45:47,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:45:47,669 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:45:47,669 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:45:47,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:45:47,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:45:47,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:45:47,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:45:47,670 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:45:47,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:45:47,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 04:45:47,671 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:45:47,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:45:47,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:45:47,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 04:45:47,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:45:47,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 04:45:47,672 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 04:45:47,672 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 04:45:47,672 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 04:45:47,672 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:45:47,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 04:45:47,673 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:45:47,673 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:45:47,673 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:45:47,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:45:47,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:45:47,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:45:47,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:45:47,674 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:45:47,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:45:47,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:45:47,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:45:47,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:45:47,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:45:47,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:45:47,675 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 04:45:47,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 04:45:47,675 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 04:45:47,675 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 04:45:47,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:45:47,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:45:47,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:45:47,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:45:47,676 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> a0d4825ef04f5689aff4ed3e5df593fedd83b7eb3ae072cea52c48718c9baf42 [2024-11-28 04:45:48,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:45:48,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:45:48,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:45:48,035 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:45:48,035 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:45:48,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-properties/simple-2.i [2024-11-28 04:45:51,042 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/data/2c95fb662/818aab1612884440b0accc44cf8bf570/FLAG7a2ea228a [2024-11-28 04:45:51,419 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:45:51,420 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/sv-benchmarks/c/list-properties/simple-2.i [2024-11-28 04:45:51,443 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/data/2c95fb662/818aab1612884440b0accc44cf8bf570/FLAG7a2ea228a [2024-11-28 04:45:51,613 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/data/2c95fb662/818aab1612884440b0accc44cf8bf570 [2024-11-28 04:45:51,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:45:51,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:45:51,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:45:51,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:45:51,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:45:51,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:45:51" (1/1) ... [2024-11-28 04:45:51,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a5d2da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:45:51, skipping insertion in model container [2024-11-28 04:45:51,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:45:51" (1/1) ... [2024-11-28 04:45:51,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:45:52,097 WARN L250 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_845e52fd-826a-4f47-b980-8ce39ba565b2/sv-benchmarks/c/list-properties/simple-2.i[23225,23238] [2024-11-28 04:45:52,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:45:52,125 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:45:52,197 WARN L250 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_845e52fd-826a-4f47-b980-8ce39ba565b2/sv-benchmarks/c/list-properties/simple-2.i[23225,23238] [2024-11-28 04:45:52,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:45:52,245 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:45:52,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:45:52 WrapperNode [2024-11-28 04:45:52,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:45:52,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:45:52,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:45:52,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:45:52,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:45:52" (1/1) ... [2024-11-28 04:45:52,274 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:45:52" (1/1) ... [2024-11-28 04:45:52,294 INFO L138 Inliner]: procedures = 127, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 50 [2024-11-28 04:45:52,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:45:52,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:45:52,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:45:52,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:45:52,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:45:52" (1/1) ... [2024-11-28 04:45:52,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:45:52" (1/1) ... [2024-11-28 04:45:52,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:45:52" (1/1) ... [2024-11-28 04:45:52,338 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-11-28 04:45:52,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:45:52" (1/1) ... [2024-11-28 04:45:52,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:45:52" (1/1) ... [2024-11-28 04:45:52,356 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:45:52" (1/1) ... [2024-11-28 04:45:52,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:45:52" (1/1) ... [2024-11-28 04:45:52,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:45:52" (1/1) ... [2024-11-28 04:45:52,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:45:52" (1/1) ... [2024-11-28 04:45:52,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:45:52" (1/1) ... [2024-11-28 04:45:52,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:45:52,376 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:45:52,376 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:45:52,376 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:45:52,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:45:52" (1/1) ... [2024-11-28 04:45:52,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:45:52,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:45:52,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:45:52,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:45:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-28 04:45:52,445 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-28 04:45:52,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-28 04:45:52,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-28 04:45:52,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 04:45:52,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:45:52,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 04:45:52,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 04:45:52,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 04:45:52,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 04:45:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-28 04:45:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-28 04:45:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 04:45:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 04:45:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:45:52,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:45:52,592 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:45:52,594 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:45:52,628 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-28 04:45:52,870 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-28 04:45:52,871 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:45:52,883 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:45:52,883 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 04:45:52,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:45:52 BoogieIcfgContainer [2024-11-28 04:45:52,884 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:45:52,888 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:45:52,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:45:52,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:45:52,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:45:51" (1/3) ... [2024-11-28 04:45:52,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa69a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:45:52, skipping insertion in model container [2024-11-28 04:45:52,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:45:52" (2/3) ... [2024-11-28 04:45:52,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa69a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:45:52, skipping insertion in model container [2024-11-28 04:45:52,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:45:52" (3/3) ... [2024-11-28 04:45:52,900 INFO L128 eAbstractionObserver]: Analyzing ICFG simple-2.i [2024-11-28 04:45:52,919 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:45:52,921 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG simple-2.i that has 2 procedures, 25 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-28 04:45:52,991 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:45:53,011 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@327f053f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:45:53,011 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 04:45:53,017 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 20 states have (on average 1.4) internal successors, (28), 22 states have internal predecessors, (28), 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) [2024-11-28 04:45:53,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 04:45:53,030 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:45:53,031 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:45:53,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:45:53,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:45:53,039 INFO L85 PathProgramCache]: Analyzing trace with hash 129654765, now seen corresponding path program 1 times [2024-11-28 04:45:53,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:45:53,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1397273656] [2024-11-28 04:45:53,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:45:53,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:45:53,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:45:53,057 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:45:53,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:45:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:45:53,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 04:45:53,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:45:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:45:53,234 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:45:53,238 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:45:53,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397273656] [2024-11-28 04:45:53,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397273656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:45:53,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:45:53,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:45:53,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909992392] [2024-11-28 04:45:53,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:45:53,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 04:45:53,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:45:53,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 04:45:53,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 04:45:53,275 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.4) internal successors, (28), 22 states have internal predecessors, (28), 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.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:45:53,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:45:53,296 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-28 04:45:53,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 04:45:53,299 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-28 04:45:53,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:45:53,306 INFO L225 Difference]: With dead ends: 35 [2024-11-28 04:45:53,310 INFO L226 Difference]: Without dead ends: 16 [2024-11-28 04:45:53,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 04:45:53,318 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:45:53,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:45:53,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-28 04:45:53,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-28 04:45:53,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:45:53,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-11-28 04:45:53,362 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 10 [2024-11-28 04:45:53,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:45:53,363 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-28 04:45:53,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:45:53,364 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-11-28 04:45:53,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 04:45:53,364 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:45:53,365 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:45:53,378 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 04:45:53,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:45:53,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:45:53,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:45:53,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1410165730, now seen corresponding path program 1 times [2024-11-28 04:45:53,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:45:53,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1897724204] [2024-11-28 04:45:53,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:45:53,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:45:53,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:45:53,576 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:45:53,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:45:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:45:53,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 04:45:53,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:45:53,878 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 22 treesize of output 7 [2024-11-28 04:45:53,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:45:53,944 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:45:53,944 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:45:53,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897724204] [2024-11-28 04:45:53,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897724204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:45:53,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:45:53,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:45:53,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753701615] [2024-11-28 04:45:53,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:45:53,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:45:53,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:45:53,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:45:53,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:45:53,949 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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) [2024-11-28 04:45:54,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:45:54,167 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-11-28 04:45:54,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:45:54,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 [2024-11-28 04:45:54,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:45:54,168 INFO L225 Difference]: With dead ends: 28 [2024-11-28 04:45:54,168 INFO L226 Difference]: Without dead ends: 26 [2024-11-28 04:45:54,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:45:54,170 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:45:54,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 33 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:45:54,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-28 04:45:54,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2024-11-28 04:45:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:45:54,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-11-28 04:45:54,175 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 11 [2024-11-28 04:45:54,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:45:54,175 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-11-28 04:45:54,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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) [2024-11-28 04:45:54,176 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-11-28 04:45:54,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-28 04:45:54,176 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:45:54,176 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:45:54,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 04:45:54,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:45:54,381 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:45:54,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:45:54,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2125731432, now seen corresponding path program 1 times [2024-11-28 04:45:54,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:45:54,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1499014463] [2024-11-28 04:45:54,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:45:54,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:45:54,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:45:54,386 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:45:54,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 04:45:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:45:54,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-28 04:45:54,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:45:54,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:45:54,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:45:54,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:45:54,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:45:54,921 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 21 [2024-11-28 04:45:54,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:45:54,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:45:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:45:54,976 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:45:54,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499014463] [2024-11-28 04:45:54,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499014463] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:45:54,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:45:54,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2024-11-28 04:45:54,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847300430] [2024-11-28 04:45:54,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:45:54,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 04:45:54,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:45:54,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 04:45:54,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:45:54,978 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:45:55,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:45:55,133 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-11-28 04:45:55,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:45:55,134 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-28 04:45:55,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:45:55,135 INFO L225 Difference]: With dead ends: 33 [2024-11-28 04:45:55,135 INFO L226 Difference]: Without dead ends: 21 [2024-11-28 04:45:55,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:45:55,136 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:45:55,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 45 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:45:55,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-28 04:45:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2024-11-28 04:45:55,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:45:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-28 04:45:55,145 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2024-11-28 04:45:55,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:45:55,145 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-28 04:45:55,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:45:55,146 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-28 04:45:55,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 04:45:55,146 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:45:55,146 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:45:55,156 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 04:45:55,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:45:55,347 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:45:55,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:45:55,348 INFO L85 PathProgramCache]: Analyzing trace with hash 963419155, now seen corresponding path program 1 times [2024-11-28 04:45:55,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:45:55,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1914481565] [2024-11-28 04:45:55,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:45:55,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:45:55,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:45:55,351 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:45:55,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 04:45:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:45:55,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-28 04:45:55,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:45:55,469 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 [2024-11-28 04:45:55,591 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:45:55,592 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 [2024-11-28 04:45:55,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:45:55,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-28 04:45:55,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 04:45:55,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:45:55,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:45:55,821 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_80 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_80) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2024-11-28 04:45:55,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:45:55,948 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 [2024-11-28 04:45:55,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:45:55,970 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 [2024-11-28 04:45:55,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-28 04:46:00,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-28 04:46:00,173 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:46:00,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914481565] [2024-11-28 04:46:00,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914481565] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:46:00,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:46:00,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-11-28 04:46:00,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270960066] [2024-11-28 04:46:00,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:46:00,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 04:46:00,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:46:00,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 04:46:00,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=65, Unknown=5, NotChecked=16, Total=110 [2024-11-28 04:46:00,176 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:46:00,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:46:00,869 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2024-11-28 04:46:00,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:46:00,870 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-28 04:46:00,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:46:00,871 INFO L225 Difference]: With dead ends: 27 [2024-11-28 04:46:00,872 INFO L226 Difference]: Without dead ends: 25 [2024-11-28 04:46:00,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=47, Invalid=133, Unknown=6, NotChecked=24, Total=210 [2024-11-28 04:46:00,874 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:46:00,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 49 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 1 Unknown, 18 Unchecked, 0.5s Time] [2024-11-28 04:46:00,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-28 04:46:00,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2024-11-28 04:46:00,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:46:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-11-28 04:46:00,886 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2024-11-28 04:46:00,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:46:00,887 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-11-28 04:46:00,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:46:00,887 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-11-28 04:46:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 04:46:00,888 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:46:00,888 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:46:00,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-28 04:46:01,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:46:01,092 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:46:01,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:46:01,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1135461913, now seen corresponding path program 1 times [2024-11-28 04:46:01,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:46:01,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1184258640] [2024-11-28 04:46:01,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:46:01,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:46:01,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:46:01,096 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:46:01,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 04:46:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:46:01,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-28 04:46:01,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:46:01,202 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 [2024-11-28 04:46:01,384 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:46:01,384 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 [2024-11-28 04:46:01,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 04:46:01,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:46:01,635 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:46:01,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 62 [2024-11-28 04:46:01,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 04:46:01,658 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 30 treesize of output 11 [2024-11-28 04:46:01,775 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 [2024-11-28 04:46:01,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 04:46:01,857 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:46:01,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:46:01,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 177 [2024-11-28 04:46:02,040 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_116 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_116) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_115 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_115) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2024-11-28 04:46:02,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:46:02,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-28 04:46:02,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:46:02,123 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 36 treesize of output 35 [2024-11-28 04:46:02,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 04:46:02,167 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-28 04:46:02,167 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 [2024-11-28 04:46:02,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-28 04:46:02,407 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:46:02,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184258640] [2024-11-28 04:46:02,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184258640] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:46:02,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:46:02,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-28 04:46:02,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135076302] [2024-11-28 04:46:02,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:46:02,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 04:46:02,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:46:02,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 04:46:02,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=150, Unknown=1, NotChecked=24, Total=210 [2024-11-28 04:46:02,409 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:46:03,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:46:03,129 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2024-11-28 04:46:03,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 04:46:03,130 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-28 04:46:03,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:46:03,131 INFO L225 Difference]: With dead ends: 40 [2024-11-28 04:46:03,131 INFO L226 Difference]: Without dead ends: 38 [2024-11-28 04:46:03,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=275, Unknown=1, NotChecked=34, Total=380 [2024-11-28 04:46:03,132 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:46:03,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 83 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 123 Invalid, 0 Unknown, 30 Unchecked, 0.4s Time] [2024-11-28 04:46:03,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-28 04:46:03,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2024-11-28 04:46:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:46:03,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2024-11-28 04:46:03,138 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2024-11-28 04:46:03,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:46:03,138 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2024-11-28 04:46:03,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:46:03,139 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2024-11-28 04:46:03,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-28 04:46:03,139 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:46:03,139 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:46:03,149 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 04:46:03,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:46:03,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:46:03,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:46:03,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1784775393, now seen corresponding path program 2 times [2024-11-28 04:46:03,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:46:03,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1660818276] [2024-11-28 04:46:03,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:46:03,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:46:03,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:46:03,347 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:46:03,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 04:46:03,456 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:46:03,456 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:46:03,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-28 04:46:03,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:46:03,469 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 [2024-11-28 04:46:03,583 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:46:03,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-28 04:46:03,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:46:03,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 04:46:03,828 INFO L349 Elim1Store]: treesize reduction 18, result has 21.7 percent of original size [2024-11-28 04:46:03,828 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 35 treesize of output 36 [2024-11-28 04:46:03,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2024-11-28 04:46:03,848 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 12 treesize of output 11 [2024-11-28 04:46:03,862 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 12 treesize of output 11 [2024-11-28 04:46:04,266 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:46:04,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:46:04,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:46:04,451 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 45 treesize of output 49 [2024-11-28 04:46:04,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:46:04,462 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 40 treesize of output 39 [2024-11-28 04:46:04,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:46:04,493 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 45 treesize of output 44 [2024-11-28 04:46:04,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:46:04,504 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 35 treesize of output 39 [2024-11-28 04:46:04,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:46:04,824 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 60 treesize of output 61 [2024-11-28 04:46:04,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:46:04,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2024-11-28 04:46:04,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:46:04,872 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 72 treesize of output 71 [2024-11-28 04:46:05,576 INFO L349 Elim1Store]: treesize reduction 42, result has 82.1 percent of original size [2024-11-28 04:46:05,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 208 treesize of output 335 [2024-11-28 04:46:05,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:46:05,761 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 168 treesize of output 192 [2024-11-28 04:46:05,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:46:05,862 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 133 treesize of output 105 [2024-11-28 04:46:26,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:46:26,951 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 60 treesize of output 61 [2024-11-28 04:46:30,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:46:30,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2024-11-28 04:48:23,324 WARN L286 SmtUtils]: Spent 1.87m on a formula simplification. DAG size of input: 47 DAG size of output: 37 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-28 04:48:23,325 INFO L349 Elim1Store]: treesize reduction 59, result has 47.3 percent of original size [2024-11-28 04:48:23,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 136 [2024-11-28 04:48:24,177 INFO L349 Elim1Store]: treesize reduction 8, result has 27.3 percent of original size [2024-11-28 04:48:24,177 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 104 treesize of output 89 [2024-11-28 04:48:24,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:48:24,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 78 [2024-11-28 04:48:24,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:48:24,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:48:24,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:48:24,224 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 112 [2024-11-28 04:48:25,095 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:48:25,095 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:48:25,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660818276] [2024-11-28 04:48:25,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660818276] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:48:25,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:48:25,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-28 04:48:25,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974558838] [2024-11-28 04:48:25,096 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:48:25,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 04:48:25,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:48:25,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 04:48:25,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=169, Unknown=5, NotChecked=0, Total=210 [2024-11-28 04:48:25,097 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:48:25,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:48:25,851 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2024-11-28 04:48:25,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:48:25,853 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-28 04:48:25,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:48:25,854 INFO L225 Difference]: With dead ends: 45 [2024-11-28 04:48:25,854 INFO L226 Difference]: Without dead ends: 29 [2024-11-28 04:48:25,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=50, Invalid=217, Unknown=5, NotChecked=0, Total=272 [2024-11-28 04:48:25,855 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:48:25,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 101 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 04:48:25,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-28 04:48:25,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-11-28 04:48:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:48:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-11-28 04:48:25,860 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 24 [2024-11-28 04:48:25,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:48:25,861 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-11-28 04:48:25,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:48:25,861 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2024-11-28 04:48:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-28 04:48:25,861 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:48:25,861 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:48:25,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 04:48:26,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:48:26,062 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:48:26,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:48:26,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2139931384, now seen corresponding path program 3 times [2024-11-28 04:48:26,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:48:26,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1025892241] [2024-11-28 04:48:26,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:48:26,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:48:26,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:48:26,065 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:48:26,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 04:48:26,700 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-28 04:48:26,700 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:48:26,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-28 04:48:26,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:48:26,717 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 [2024-11-28 04:48:26,866 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 04:48:26,866 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 [2024-11-28 04:48:26,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:48:26,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 04:48:27,111 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 04:48:27,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 04:48:27,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:48:27,169 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 04:48:27,169 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 [2024-11-28 04:48:27,205 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-28 04:48:27,205 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 [2024-11-28 04:48:27,382 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-28 04:48:27,383 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 143 treesize of output 89 [2024-11-28 04:48:27,396 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 [2024-11-28 04:48:27,439 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 39 treesize of output 15 [2024-11-28 04:48:27,699 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-11-28 04:48:27,699 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 109 treesize of output 84 [2024-11-28 04:48:27,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:48:27,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2024-11-28 04:48:27,732 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 16 treesize of output 15 [2024-11-28 04:48:27,770 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 36 treesize of output 15 [2024-11-28 04:48:27,794 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 16 treesize of output 15 [2024-11-28 04:48:28,058 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2024-11-28 04:48:28,058 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 46 [2024-11-28 04:48:28,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:48:28,194 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:48:28,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:48:28,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:48:28,427 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 74 treesize of output 72 [2024-11-28 04:48:28,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:48:28,440 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 64 treesize of output 62 [2024-11-28 04:48:28,552 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_13 .cse0))) (= (_ bv0 32) .cse1) (forall ((v_ArrVal_213 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 .cse0))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_213) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) .cse1) (_ bv1 32))))))) (forall ((v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_13 .cse0))) (forall ((v_ArrVal_213 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (_ bv0 32) .cse3) (not (= (_ bv0 32) (select v_arrayElimArr_12 .cse0))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_213) .cse3) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (_ bv1 32))))))))) is different from false [2024-11-28 04:48:28,847 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|)) (.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse6 (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|) .cse2 |c_ULTIMATE.start_main_~t~0#1.offset|))) (.cse3 (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|) .cse2 |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse4 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_205 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_13 .cse0))) (forall ((v_ArrVal_213 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_12 .cse0) (_ bv0 32))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse1 .cse2 v_ArrVal_205)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_213) (select (select (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) .cse5) (_ bv1 32)))) (= (_ bv0 32) .cse5)))) (forall ((v_ArrVal_205 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_13 .cse0))) (forall ((v_ArrVal_213 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_12 .cse0) (_ bv0 32))) (= .cse7 (_ bv0 32)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse1 .cse2 v_ArrVal_205)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_213) .cse7) (select (select (store .cse6 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (_ bv1 32)))))))))) is different from false [2024-11-28 04:48:29,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:48:29,250 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 181 treesize of output 175 [2024-11-28 04:48:29,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:48:29,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 198 treesize of output 218 [2024-11-28 04:48:29,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:48:29,756 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 461 treesize of output 556 [2024-11-28 04:48:29,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:48:29,789 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 552 treesize of output 515 [2024-11-28 04:48:29,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:48:29,876 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 352 treesize of output 356 [2024-11-28 04:48:29,908 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 327 treesize of output 291 [2024-11-28 04:48:29,931 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 291 treesize of output 273 [2024-11-28 04:48:36,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-28 04:48:36,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-28 04:48:37,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-28 04:48:37,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 8 treesize of output 4 [2024-11-28 04:48:37,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-28 04:48:37,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-28 04:48:38,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 52 [2024-11-28 04:48:38,886 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 84 treesize of output 64 [2024-11-28 04:48:39,719 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse1 (select (select (store .cse2 .cse0 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= .cse0 .cse1)) (= (select (select (store .cse2 .cse0 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse1) (= (_ bv0 32) .cse1))))) (not (= (select |c_#valid| .cse0) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse5 (select (select (store .cse7 .cse8 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (.cse6 (select (select (store .cse7 .cse8 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse5) (= .cse5 .cse6) (= (_ bv0 32) .cse6) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse6))))) (not (= (select |c_#valid| .cse8) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse9 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse10 (select (select (store .cse12 .cse9 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (.cse11 (select (select (store .cse12 .cse9 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse10) (= .cse10 .cse11) (= (_ bv0 32) .cse11))))) (not (= (select |c_#valid| .cse9) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse13 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse14 (select (select (store .cse15 .cse13 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse14) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (= .cse14 (select (select (store .cse15 .cse13 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))))) (not (= (select |c_#valid| .cse13) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse16 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (let ((.cse17 (select (select (store .cse18 .cse16 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= (_ bv0 32) .cse17) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (= .cse17 (select (select (store .cse18 .cse16 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))))) (not (= (select |c_#valid| .cse16) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse20 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse19) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (not (= .cse20 .cse19))))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse20 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))) (not (= (select |c_#valid| .cse20) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (let ((.cse21 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (= (select (select (store .cse21 .cse22 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (select (select (store .cse21 .cse22 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse22 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse23) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse23)))) (not (= (select |c_#valid| .cse22) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse24 (select (select (store .cse27 .cse25 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (.cse26 (select (select (store .cse27 .cse25 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse24) (not (= .cse25 .cse26)) (= .cse24 .cse26) (= (_ bv0 32) .cse26) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse26))))) (not (= (select |c_#valid| .cse25) (_ bv0 1)))))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_80 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (let ((.cse28 (select (select (store .cse29 v_arrayElimCell_80 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (= (_ bv0 32) .cse28) (= .cse28 |c_ULTIMATE.start_main_~p~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store .cse29 v_arrayElimCell_80 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_80))) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))))) (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select v_arrayElimArr_14 .cse4))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse30 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse30 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= .cse30 .cse31)) (= (_ bv0 32) .cse31) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse31)))) (not (= (select |c_#valid| .cse30) (_ bv0 1)))))) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse32 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse33 (select (select (store .cse35 .cse32 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (.cse34 (select (select (store .cse35 .cse32 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse33) (not (= .cse32 .cse34)) (= .cse33 .cse34) (= (_ bv0 32) .cse34))))) (not (= (select |c_#valid| .cse32) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (not (= .cse36 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse36 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (let ((.cse37 (select (select (store .cse38 .cse36 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= (_ bv0 32) .cse37) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (= .cse37 (select (select (store .cse38 .cse36 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))))) (not (= (select |c_#valid| .cse36) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse40 (select (select (store .cse41 .cse39 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (not (= .cse39 .cse40)) (= .cse40 (select (select (store .cse41 .cse39 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse39 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))) (not (= (select |c_#valid| .cse39) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse44 (select (select (store .cse42 .cse43 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (select (select (store .cse42 .cse43 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse44) (= (_ bv0 32) .cse44) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse44))))) (not (= (select |c_#valid| .cse43) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (let ((.cse47 (select (select (store .cse45 .cse46 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (= (select (select (store .cse45 .cse46 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse47) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse47))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse46 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (= (select |c_#valid| .cse46) (_ bv0 1)))))) (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse49 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse48) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse48)))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse49 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select |c_#valid| .cse49) (_ bv0 1)))))) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse50 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse51 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse50 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= (_ bv0 32) .cse51) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (= .cse51 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32))))))) (not (= (select |c_#valid| .cse50) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse53 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14)) (.cse54 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (select (select (store .cse53 .cse54 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse52) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse52)))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse53 .cse54 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (not (= (select |c_#valid| .cse54) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse55 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse55 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse56 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (= (select (select (store .cse56 .cse55 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store .cse56 .cse55 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))) (not (= (select |c_#valid| .cse55) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse57 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (not (= .cse57 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse57 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))) (not (= (select |c_#valid| .cse57) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse58 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))))) (not (= (select |c_#valid| .cse58) (_ bv0 1))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (or (= (_ bv0 32) (select (select (store .cse59 .cse58 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store .cse59 .cse58 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14)) (.cse60 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse60 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse61 .cse60 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse61 .cse60 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))))) (not (= (select |c_#valid| .cse60) (_ bv0 1)))))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_81 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (let ((.cse63 (select (select (store .cse62 v_arrayElimCell_81 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (= (select (select (store .cse62 v_arrayElimCell_81 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse63) (= (_ bv0 32) .cse63) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse63) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_81))) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse64 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse65 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= (_ bv0 32) .cse64) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (= .cse64 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32))))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (let ((.cse66 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (= (select (select (store .cse66 .cse65 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (select (select (store .cse66 .cse65 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))) (not (= (select |c_#valid| .cse65) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14)) (.cse68 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (let ((.cse67 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (= (select (select (store .cse67 .cse68 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (select (select (store .cse67 .cse68 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse69 (select (select (store .cse70 .cse68 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse69) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse69)))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse70 .cse68 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (not (= (select |c_#valid| .cse68) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse71 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (not (= .cse71 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse71 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse72 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse71 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= (_ bv0 32) .cse72) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (= .cse72 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32))))))) (not (= (select |c_#valid| .cse71) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse74 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14)) (.cse75 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse73 (select (select (store .cse74 .cse75 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse73) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse73)))) (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse75 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse74 .cse75 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (not (= (select |c_#valid| .cse75) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse76 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse76 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse77 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse78 (select (select (store .cse77 .cse76 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (select (select (store .cse77 .cse76 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse78) (= (_ bv0 32) .cse78))))) (not (= (select |c_#valid| .cse76) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse79 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse80 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse79 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= .cse79 .cse80)) (= (_ bv0 32) .cse80)))) (not (= (select |c_#valid| .cse79) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse82 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14)) (.cse83 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse81 (select (select (store .cse82 .cse83 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse81) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse81)))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse84 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (let ((.cse85 (select (select (store .cse84 .cse83 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (= (select (select (store .cse84 .cse83 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse85) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse85))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse82 .cse83 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (not (= (select |c_#valid| .cse83) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse86 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse86 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse87 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse86 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse87)) (= (_ bv0 32) .cse87)))) (not (= (select |c_#valid| .cse86) (_ bv0 1)))))))) is different from false [2024-11-28 04:48:44,061 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse1 (select (select (store .cse2 .cse0 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= .cse0 .cse1)) (= (select (select (store .cse2 .cse0 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse1) (= (_ bv0 32) .cse1))))) (not (= (select |c_#valid| .cse0) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse5 (select (select (store .cse7 .cse8 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (.cse6 (select (select (store .cse7 .cse8 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse5) (= .cse5 .cse6) (= (_ bv0 32) .cse6) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse6))))) (not (= (select |c_#valid| .cse8) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse9 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse10 (select (select (store .cse12 .cse9 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (.cse11 (select (select (store .cse12 .cse9 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse10) (= .cse10 .cse11) (= (_ bv0 32) .cse11))))) (not (= (select |c_#valid| .cse9) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse13 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse14 (select (select (store .cse15 .cse13 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse14) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (= .cse14 (select (select (store .cse15 .cse13 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))))) (not (= (select |c_#valid| .cse13) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse16 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (let ((.cse17 (select (select (store .cse18 .cse16 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= (_ bv0 32) .cse17) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (= .cse17 (select (select (store .cse18 .cse16 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))))) (not (= (select |c_#valid| .cse16) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse20 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse19) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (not (= .cse20 .cse19))))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse20 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))) (not (= (select |c_#valid| .cse20) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (let ((.cse21 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (= (select (select (store .cse21 .cse22 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (select (select (store .cse21 .cse22 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse22 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse23) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse23)))) (not (= (select |c_#valid| .cse22) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse24 (select (select (store .cse27 .cse25 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (.cse26 (select (select (store .cse27 .cse25 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse24) (not (= .cse25 .cse26)) (= .cse24 .cse26) (= (_ bv0 32) .cse26) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse26))))) (not (= (select |c_#valid| .cse25) (_ bv0 1)))))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_80 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (let ((.cse28 (select (select (store .cse29 v_arrayElimCell_80 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (= (_ bv0 32) .cse28) (= .cse28 |c_ULTIMATE.start_main_~p~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store .cse29 v_arrayElimCell_80 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_80))) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))))) (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select v_arrayElimArr_14 .cse4))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse30 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse30 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= .cse30 .cse31)) (= (_ bv0 32) .cse31) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse31)))) (not (= (select |c_#valid| .cse30) (_ bv0 1)))))) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse32 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse33 (select (select (store .cse35 .cse32 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (.cse34 (select (select (store .cse35 .cse32 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse33) (not (= .cse32 .cse34)) (= .cse33 .cse34) (= (_ bv0 32) .cse34))))) (not (= (select |c_#valid| .cse32) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (not (= .cse36 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse36 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (let ((.cse37 (select (select (store .cse38 .cse36 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= (_ bv0 32) .cse37) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (= .cse37 (select (select (store .cse38 .cse36 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))))) (not (= (select |c_#valid| .cse36) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse40 (select (select (store .cse41 .cse39 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (not (= .cse39 .cse40)) (= .cse40 (select (select (store .cse41 .cse39 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse39 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))) (not (= (select |c_#valid| .cse39) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse44 (select (select (store .cse42 .cse43 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (select (select (store .cse42 .cse43 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse44) (= (_ bv0 32) .cse44) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse44))))) (not (= (select |c_#valid| .cse43) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (let ((.cse47 (select (select (store .cse45 .cse46 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (= (select (select (store .cse45 .cse46 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse47) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse47))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse46 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (= (select |c_#valid| .cse46) (_ bv0 1)))))) (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse49 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse48) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse48)))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse49 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select |c_#valid| .cse49) (_ bv0 1)))))) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse50 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse51 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse50 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= (_ bv0 32) .cse51) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (= .cse51 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32))))))) (not (= (select |c_#valid| .cse50) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse53 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14)) (.cse54 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (select (select (store .cse53 .cse54 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse52) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse52)))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse53 .cse54 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (not (= (select |c_#valid| .cse54) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse55 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse55 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse56 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (= (select (select (store .cse56 .cse55 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store .cse56 .cse55 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))) (not (= (select |c_#valid| .cse55) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse57 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (not (= .cse57 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse57 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))) (not (= (select |c_#valid| .cse57) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse58 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))))) (not (= (select |c_#valid| .cse58) (_ bv0 1))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (or (= (_ bv0 32) (select (select (store .cse59 .cse58 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store .cse59 .cse58 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14)) (.cse60 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse60 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse61 .cse60 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse61 .cse60 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))))) (not (= (select |c_#valid| .cse60) (_ bv0 1)))))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_81 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (let ((.cse63 (select (select (store .cse62 v_arrayElimCell_81 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (= (select (select (store .cse62 v_arrayElimCell_81 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse63) (= (_ bv0 32) .cse63) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse63) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_81))) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse64 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse65 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= (_ bv0 32) .cse64) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (= .cse64 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32))))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (let ((.cse66 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (= (select (select (store .cse66 .cse65 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (select (select (store .cse66 .cse65 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))) (not (= (select |c_#valid| .cse65) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14)) (.cse68 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (let ((.cse67 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (= (select (select (store .cse67 .cse68 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (select (select (store .cse67 .cse68 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse69 (select (select (store .cse70 .cse68 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse69) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse69)))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse70 .cse68 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (not (= (select |c_#valid| .cse68) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse71 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (not (= .cse71 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse71 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse72 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse71 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= (_ bv0 32) .cse72) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (= .cse72 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32))))))) (not (= (select |c_#valid| .cse71) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse74 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14)) (.cse75 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse73 (select (select (store .cse74 .cse75 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse73) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse73)))) (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse75 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse74 .cse75 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (not (= (select |c_#valid| .cse75) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse76 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse76 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse77 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse78 (select (select (store .cse77 .cse76 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (select (select (store .cse77 .cse76 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse78) (= (_ bv0 32) .cse78))))) (not (= (select |c_#valid| .cse76) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse79 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse80 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse79 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= .cse79 .cse80)) (= (_ bv0 32) .cse80)))) (not (= (select |c_#valid| .cse79) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse82 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14)) (.cse83 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse81 (select (select (store .cse82 .cse83 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse81) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse81)))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse84 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (let ((.cse85 (select (select (store .cse84 .cse83 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (= (select (select (store .cse84 .cse83 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse85) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse85))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse82 .cse83 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (not (= (select |c_#valid| .cse83) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse86 (select v_arrayElimArr_14 .cse4))) (or (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse4))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse86 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse87 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse86 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse87)) (= (_ bv0 32) .cse87)))) (not (= (select |c_#valid| .cse86) (_ bv0 1)))))))) is different from true [2024-11-28 04:49:02,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:02,421 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 76 treesize of output 56 [2024-11-28 04:49:02,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:02,610 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 188 treesize of output 175 [2024-11-28 04:49:02,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:02,839 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 113 treesize of output 103 [2024-11-28 04:49:03,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:03,036 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 85 treesize of output 77 [2024-11-28 04:49:03,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2024-11-28 04:49:05,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:05,681 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 29 treesize of output 30 [2024-11-28 04:49:05,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:05,768 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 60 treesize of output 50 [2024-11-28 04:49:05,833 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:49:06,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:06,169 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 36 treesize of output 35 [2024-11-28 04:49:06,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:06,751 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 326 treesize of output 307 [2024-11-28 04:49:06,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:06,936 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 105 treesize of output 95 [2024-11-28 04:49:07,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:07,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 102 [2024-11-28 04:49:08,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:08,065 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 20 treesize of output 20 [2024-11-28 04:49:08,196 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 04:49:08,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:08,294 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 29 treesize of output 30 [2024-11-28 04:49:08,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:08,382 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 93 treesize of output 73 [2024-11-28 04:49:08,479 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:49:08,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:08,755 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 36 treesize of output 35 [2024-11-28 04:49:09,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:09,231 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 257 treesize of output 244 [2024-11-28 04:49:09,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:09,429 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 235 treesize of output 217 [2024-11-28 04:49:09,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:09,599 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 215 treesize of output 143 [2024-11-28 04:49:12,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:12,122 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 20 treesize of output 20 [2024-11-28 04:49:12,304 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-28 04:49:12,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2024-11-28 04:49:12,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:12,403 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 59 treesize of output 49 [2024-11-28 04:49:12,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:12,493 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 29 treesize of output 30 [2024-11-28 04:49:12,562 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:49:12,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:12,822 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 36 treesize of output 35 [2024-11-28 04:49:13,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:13,080 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 20 treesize of output 20 [2024-11-28 04:49:13,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:13,619 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 164 treesize of output 157 [2024-11-28 04:49:13,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:13,829 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 39 treesize of output 37 [2024-11-28 04:49:14,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:14,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 56 [2024-11-28 04:49:15,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:15,247 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 29 treesize of output 30 [2024-11-28 04:49:15,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:15,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 68 [2024-11-28 04:49:15,390 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:49:15,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:15,670 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 36 treesize of output 35 [2024-11-28 04:49:15,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:15,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2024-11-28 04:49:16,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:16,452 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 314 treesize of output 295 [2024-11-28 04:49:16,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:16,632 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 145 treesize of output 135 [2024-11-28 04:49:16,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:16,819 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 194 treesize of output 146 [2024-11-28 04:49:16,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-28 04:49:19,009 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-28 04:49:19,009 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 1 [2024-11-28 04:49:19,085 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-28 04:49:19,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 1 [2024-11-28 04:49:19,147 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-28 04:49:19,147 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 119 treesize of output 1 [2024-11-28 04:49:19,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:19,246 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 59 treesize of output 49 [2024-11-28 04:49:19,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:19,335 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 29 treesize of output 30 [2024-11-28 04:49:19,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:19,673 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 161 treesize of output 154 [2024-11-28 04:49:19,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:19,872 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 76 treesize of output 74 [2024-11-28 04:49:19,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2024-11-28 04:49:20,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:20,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 69 [2024-11-28 04:49:20,189 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:49:20,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:20,433 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 36 treesize of output 35 [2024-11-28 04:49:20,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:20,767 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 136 treesize of output 104 [2024-11-28 04:49:22,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:22,156 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 29 treesize of output 30 [2024-11-28 04:49:22,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:22,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 59 treesize of output 49 [2024-11-28 04:49:22,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:22,609 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 164 treesize of output 157 [2024-11-28 04:49:22,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:22,822 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 38 treesize of output 38 [2024-11-28 04:49:22,892 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:49:23,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:23,237 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 36 treesize of output 35 [2024-11-28 04:49:23,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:23,454 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 39 treesize of output 37 [2024-11-28 04:49:23,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:23,662 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 71 treesize of output 63 [2024-11-28 04:49:25,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:25,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 54 [2024-11-28 04:49:25,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:25,348 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 358 treesize of output 339 [2024-11-28 04:49:25,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:25,503 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 154 treesize of output 118 [2024-11-28 04:49:25,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:25,695 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 89 treesize of output 79 [2024-11-28 04:49:29,190 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-28 04:49:29,191 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 114 treesize of output 1 [2024-11-28 04:49:29,263 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-28 04:49: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 85 treesize of output 1 [2024-11-28 04:49:29,329 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-28 04:49:29,329 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 98 treesize of output 1 [2024-11-28 04:49:29,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:29,430 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 59 treesize of output 49 [2024-11-28 04:49:29,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:29,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2024-11-28 04:49:29,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:29,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 154 [2024-11-28 04:49:29,986 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:49:30,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:30,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2024-11-28 04:49:30,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:30,490 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 179 treesize of output 139 [2024-11-28 04:49:30,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:30,700 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 113 treesize of output 103 [2024-11-28 04:49:30,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:30,914 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 57 treesize of output 53 [2024-11-28 04:49:33,145 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-28 04:49:33,145 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 55 treesize of output 1 [2024-11-28 04:49:33,173 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 04:49:33,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:33,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 1 case distinctions, treesize of input 29 treesize of output 30 [2024-11-28 04:49:33,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:33,368 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 59 treesize of output 49 [2024-11-28 04:49:33,438 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:49:33,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:33,698 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 36 treesize of output 35 [2024-11-28 04:49:33,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:33,994 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 20 treesize of output 20 [2024-11-28 04:49:34,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:34,481 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 317 treesize of output 298 [2024-11-28 04:49:34,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:34,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 61 [2024-11-28 04:49:34,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:34,906 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 117 treesize of output 97 [2024-11-28 04:49:36,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:36,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-11-28 04:49:36,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:36,587 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 54 [2024-11-28 04:49:36,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:36,963 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 86 treesize of output 85 [2024-11-28 04:49:37,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:37,155 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 76 treesize of output 74 [2024-11-28 04:49:37,232 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:49:37,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:37,498 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 72 treesize of output 65 [2024-11-28 04:49:37,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:37,724 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 113 treesize of output 85 [2024-11-28 04:49:38,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:38,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2024-11-28 04:49:41,930 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-28 04:49:41,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 1 [2024-11-28 04:49:42,001 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-28 04:49:42,001 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 143 treesize of output 1 [2024-11-28 04:49:42,082 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-28 04:49:42,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 1 [2024-11-28 04:49:42,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:42,195 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 29 treesize of output 30 [2024-11-28 04:49:42,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:42,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2024-11-28 04:49:42,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:42,694 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 164 treesize of output 157 [2024-11-28 04:49:42,775 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:49:43,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:43,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2024-11-28 04:49:43,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:43,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 38 treesize of output 38 [2024-11-28 04:49:43,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:43,481 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 98 treesize of output 82 [2024-11-28 04:49:43,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:43,690 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 35 treesize of output 33 [2024-11-28 04:49:46,192 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 04:49:46,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:46,302 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 59 treesize of output 49 [2024-11-28 04:49:46,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:46,404 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 29 treesize of output 30 [2024-11-28 04:49:46,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:46,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 317 treesize of output 298 [2024-11-28 04:49:47,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:47,049 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 67 treesize of output 63 [2024-11-28 04:49:47,132 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:49:47,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:47,408 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 36 treesize of output 35 [2024-11-28 04:49:47,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:47,757 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 71 treesize of output 61 [2024-11-28 04:49:47,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:47,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 104 [2024-11-28 04:49:49,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:49,241 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 68 [2024-11-28 04:49:49,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:49,602 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 392 treesize of output 367 [2024-11-28 04:49:49,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2024-11-28 04:49:49,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:49,862 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 194 treesize of output 154 [2024-11-28 04:49:50,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:49:50,066 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 63 treesize of output 53 [2024-11-28 04:49:52,407 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-28 04:49:52,407 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 29 treesize of output 1 [2024-11-28 04:49:52,488 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-28 04:49:52,488 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 29 treesize of output 1 [2024-11-28 04:49:52,570 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-28 04:49:52,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2024-11-28 04:50:11,569 WARN L286 SmtUtils]: Spent 18.50s on a formula simplification. DAG size of input: 261 DAG size of output: 253 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 04:51:07,975 WARN L286 SmtUtils]: Spent 19.02s on a formula simplification that was a NOOP. DAG size: 398 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 04:51:58,696 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-28 04:51:58,697 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:51:58,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025892241] [2024-11-28 04:51:58,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025892241] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:51:58,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:51:58,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2024-11-28 04:51:58,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560433394] [2024-11-28 04:51:58,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:51:58,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 04:51:58,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:51:58,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 04:51:58,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=253, Unknown=4, NotChecked=102, Total=420 [2024-11-28 04:51:58,699 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:52:04,563 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv4 32))) (.cse4 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse2 (select (select (store .cse3 .cse1 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= .cse1 .cse2)) (= (select (select (store .cse3 .cse1 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse2) (= (_ bv0 32) .cse2))))) (not (= (select |c_#valid| .cse1) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse6 (select (select (store .cse8 .cse9 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse7 (select (select (store .cse8 .cse9 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse6) (= .cse6 .cse7) (= (_ bv0 32) .cse7) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse7))))) (not (= (select |c_#valid| .cse9) (_ bv0 1)))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse10 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse11 (select (select (store .cse13 .cse10 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse12 (select (select (store .cse13 .cse10 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse11) (= .cse11 .cse12) (= (_ bv0 32) .cse12))))) (not (= (select |c_#valid| .cse10) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse14 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse15 (select (select (store .cse16 .cse14 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse15) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (= .cse15 (select (select (store .cse16 .cse14 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) (not (= (select |c_#valid| .cse14) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse17 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (let ((.cse18 (select (select (store .cse19 .cse17 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= (_ bv0 32) .cse18) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))) (= .cse18 (select (select (store .cse19 .cse17 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))))) (not (= (select |c_#valid| .cse17) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse21 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse20) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (not (= .cse21 .cse20))))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse21 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))) (not (= (select |c_#valid| .cse21) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (let ((.cse22 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (= (select (select (store .cse22 .cse23 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (select (select (store .cse22 .cse23 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse23 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse24) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse24)))) (not (= (select |c_#valid| .cse23) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse25 (select (select (store .cse28 .cse26 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse27 (select (select (store .cse28 .cse26 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse25) (not (= .cse26 .cse27)) (= .cse25 .cse27) (= (_ bv0 32) .cse27) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse27))))) (not (= (select |c_#valid| .cse26) (_ bv0 1)))))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_80 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (let ((.cse29 (select (select (store .cse30 v_arrayElimCell_80 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))) (= (_ bv0 32) .cse29) (= .cse29 |c_ULTIMATE.start_main_~p~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store .cse30 v_arrayElimCell_80 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_80))) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))))) (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (select v_arrayElimArr_14 .cse5))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse31 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse31 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= .cse31 .cse32)) (= (_ bv0 32) .cse32) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse32)))) (not (= (select |c_#valid| .cse31) (_ bv0 1)))))) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse33 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse34 (select (select (store .cse36 .cse33 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (.cse35 (select (select (store .cse36 .cse33 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse34) (not (= .cse33 .cse35)) (= .cse34 .cse35) (= (_ bv0 32) .cse35))))) (not (= (select |c_#valid| .cse33) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (not (= .cse37 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse37 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (let ((.cse38 (select (select (store .cse39 .cse37 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= (_ bv0 32) .cse38) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))) (= .cse38 (select (select (store .cse39 .cse37 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))))) (not (= (select |c_#valid| .cse37) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse40 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse41 (select (select (store .cse42 .cse40 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (not (= .cse40 .cse41)) (= .cse41 (select (select (store .cse42 .cse40 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse40 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))) (not (= (select |c_#valid| .cse40) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse45 (select (select (store .cse43 .cse44 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (select (select (store .cse43 .cse44 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse45) (= (_ bv0 32) .cse45) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse45))))) (not (= (select |c_#valid| .cse44) (_ bv0 1)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (let ((.cse48 (select (select (store .cse46 .cse47 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (= (select (select (store .cse46 .cse47 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse48) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse48))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse47 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (not (= (select |c_#valid| .cse47) (_ bv0 1)))))) (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse50 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse49) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse49)))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse50 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select |c_#valid| .cse50) (_ bv0 1)))))) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| .cse0))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse51 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse51 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse51 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= (_ bv0 32) .cse52) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))) (= .cse52 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32))))))) (not (= (select |c_#valid| .cse51) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse54 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14)) (.cse55 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse53 (select (select (store .cse54 .cse55 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse53) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse53)))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse54 .cse55 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (not (= (select |c_#valid| .cse55) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse56 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse56 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))) (= (select (select (store .cse57 .cse56 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store .cse57 .cse56 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (not (= (select |c_#valid| .cse56) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse58 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (not (= .cse58 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse58 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (not (= (select |c_#valid| .cse58) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse59 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))))) (not (= (select |c_#valid| .cse59) (_ bv0 1))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse60 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (or (= (_ bv0 32) (select (select (store .cse60 .cse59 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store .cse60 .cse59 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14)) (.cse61 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse61 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse62 .cse61 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse62 .cse61 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))))) (not (= (select |c_#valid| .cse61) (_ bv0 1)))))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_81 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (let ((.cse64 (select (select (store .cse63 v_arrayElimCell_81 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))) (= (select (select (store .cse63 v_arrayElimCell_81 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse64) (= (_ bv0 32) .cse64) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse64) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_81))) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32)))))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse66 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse66 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= (_ bv0 32) .cse65) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))) (= .cse65 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32))))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (let ((.cse67 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (= (select (select (store .cse67 .cse66 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (select (select (store .cse67 .cse66 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (not (= (select |c_#valid| .cse66) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse71 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14)) (.cse69 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (let ((.cse68 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (= (select (select (store .cse68 .cse69 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (select (select (store .cse68 .cse69 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (select (select (store .cse71 .cse69 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse70) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse70)))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse71 .cse69 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (not (= (select |c_#valid| .cse69) (_ bv0 1)))))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv4 32))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse72 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_prenex_5 (_ bv4 32)))) (not (= .cse72 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse72 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse73 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse72 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= (_ bv0 32) .cse73) (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))) (= .cse73 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (_ bv0 32) (select v_prenex_6 (_ bv4 32))))))) (not (= (select |c_#valid| .cse72) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse75 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14)) (.cse76 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse74 (select (select (store .cse75 .cse76 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse74) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse74)))) (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse76 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse75 .cse76 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (not (= (select |c_#valid| .cse76) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse77 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse77 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse78 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14))) (let ((.cse79 (select (select (store .cse78 .cse77 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (select (select (store .cse78 .cse77 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse79) (= (_ bv0 32) .cse79))))) (not (= (select |c_#valid| .cse77) (_ bv0 1)))))) (= (_ bv0 32) |c_ULTIMATE.start_main_~p~0#1.offset|) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse80 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse81 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse80 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= .cse80 .cse81)) (= (_ bv0 32) .cse81)))) (not (= (select |c_#valid| .cse80) (_ bv0 1)))))) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse83 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14)) (.cse84 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse82 (select (select (store .cse83 .cse84 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (= (_ bv0 32) .cse82) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse82)))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse85 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17))) (let ((.cse86 (select (select (store .cse85 .cse84 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (= (select (select (store .cse85 .cse84 v_prenex_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse86) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse86))))) (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store .cse83 .cse84 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (not (= (select |c_#valid| .cse84) (_ bv0 1)))))) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse87 (select v_arrayElimArr_14 .cse5))) (or (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_17 .cse5))) (not (= (_ bv0 32) (select v_arrayElimArr_13 (_ bv4 32)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse87 v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse88 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse87 v_arrayElimArr_12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (_ bv0 32) (select v_arrayElimArr_12 (_ bv4 32)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse88)) (= (_ bv0 32) .cse88)))) (not (= (select |c_#valid| .cse87) (_ bv0 1)))))))) is different from true [2024-11-28 04:52:10,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:52:10,351 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2024-11-28 04:52:10,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 04:52:10,352 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-28 04:52:10,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:52:10,353 INFO L225 Difference]: With dead ends: 45 [2024-11-28 04:52:10,353 INFO L226 Difference]: Without dead ends: 43 [2024-11-28 04:52:10,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 58.8s TimeCoverageRelationStatistics Valid=87, Invalid=344, Unknown=5, NotChecked=164, Total=600 [2024-11-28 04:52:10,355 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 11 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:52:10,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 102 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 167 Invalid, 0 Unknown, 150 Unchecked, 5.3s Time] [2024-11-28 04:52:10,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-28 04:52:10,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-11-28 04:52:10,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:52:10,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2024-11-28 04:52:10,367 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 25 [2024-11-28 04:52:10,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:52:10,367 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-11-28 04:52:10,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:52:10,367 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2024-11-28 04:52:10,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 04:52:10,368 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:52:10,368 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:52:10,379 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 04:52:10,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:52:10,569 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:52:10,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:52:10,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1944118414, now seen corresponding path program 4 times [2024-11-28 04:52:10,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:52:10,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [868782352] [2024-11-28 04:52:10,569 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 04:52:10,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:52:10,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:52:10,572 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:52:10,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_845e52fd-826a-4f47-b980-8ce39ba565b2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 04:52:10,680 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 04:52:10,680 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:52:10,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-28 04:52:10,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:52:10,738 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 [2024-11-28 04:52:12,521 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 04:52:12,521 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 [2024-11-28 04:52:13,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 04:52:13,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:52:15,511 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 04:52:15,511 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 [2024-11-28 04:52:16,069 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-28 04:52:16,069 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 [2024-11-28 04:52:16,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:52:16,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 04:52:17,550 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-28 04:52:17,551 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 [2024-11-28 04:52:17,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:52:18,025 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 [2024-11-28 04:52:20,259 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-11-28 04:52:20,260 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 116 treesize of output 87 [2024-11-28 04:52:20,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:52:20,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2024-11-28 04:52:20,652 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 16 treesize of output 15 [2024-11-28 04:52:20,835 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 16 treesize of output 15 [2024-11-28 04:52:21,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2024-11-28 04:52:27,418 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-28 04:52:27,418 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 50 [2024-11-28 04:52:27,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:52:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:52:28,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:52:32,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:52:32,364 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 128 [2024-11-28 04:52:32,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:52:32,474 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 120 treesize of output 108 [2024-11-28 04:52:32,691 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 1028 treesize of output 912 [2024-11-28 04:52:34,574 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (_ bv0 32) .cse0) (forall ((v_arrayElimArr_58 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select .cse1 .cse0) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_58) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 32) (select v_arrayElimArr_58 .cse3))))) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))))))) (forall ((v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (forall ((v_arrayElimArr_58 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_58))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (_ bv0 32) (select v_arrayElimArr_58 .cse3))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select .cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (bvadd (_ bv4 32) .cse5))) (= (_ bv0 32) .cse5))))))) (forall ((v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (forall ((v_arrayElimArr_58 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_58) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (bvadd (_ bv4 32) .cse7)) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (_ bv0 32) (select v_arrayElimArr_58 .cse3))) (= (_ bv0 32) .cse7)))))) (forall ((v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_57) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (_ bv0 32) .cse8) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse3))) (forall ((v_arrayElimArr_58 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_58 .cse3))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (let ((.cse9 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_58))) (select (select .cse9 .cse8) (bvadd (_ bv4 32) (select (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))))))) is different from false [2024-11-28 04:52:37,113 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (let ((.cse2 (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|) .cse12 |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|)) (.cse1 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse5 (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|) .cse12 |c_ULTIMATE.start_main_~t~0#1.offset|)))) (and (forall ((v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_58 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_58) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~t~0#1.base| (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_57))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (bvadd (_ bv4 32) .cse3))) (= (_ bv0 32) .cse3) (not (= (_ bv0 32) (select v_arrayElimArr_58 .cse4)))))) (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse4))))) (forall ((v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (store .cse2 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_57) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse4))) (forall ((v_arrayElimArr_58 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~t~0#1.offset| (let ((.cse6 (store .cse5 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_58))) (select (select .cse6 .cse7) (bvadd (_ bv4 32) (select (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) (not (= (_ bv0 32) (select v_arrayElimArr_58 .cse4))))) (= (_ bv0 32) .cse7)))) (forall ((v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_57))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse4))) (forall ((v_arrayElimArr_58 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~t~0#1.base| (select (select .cse8 .cse9) (bvadd (_ bv4 32) (select (select (store .cse5 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_58) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (not (= (_ bv0 32) (select v_arrayElimArr_58 .cse4))))) (= (_ bv0 32) .cse9))))) (forall ((v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select v_arrayElimArr_57 .cse4))) (forall ((v_arrayElimArr_58 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store .cse5 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_58))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~t~0#1.offset| (select (select .cse10 (select (select (store .cse2 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_57) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (bvadd (_ bv4 32) .cse11))) (= (_ bv0 32) .cse11) (not (= (_ bv0 32) (select v_arrayElimArr_58 .cse4)))))))))))) is different from false [2024-11-28 04:52:38,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:52:38,261 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 349 treesize of output 318 [2024-11-28 04:52:38,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:52:38,417 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 381 treesize of output 350 [2024-11-28 04:52:51,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:52:51,662 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 111 treesize of output 101 [2024-11-28 04:52:51,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:52:51,770 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 71 treesize of output 62 [2024-11-28 04:52:52,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:52:52,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 573 treesize of output 554 [2024-11-28 04:52:52,901 INFO L224 Elim1Store]: Index analysis took 484 ms [2024-11-28 04:53:08,919 WARN L286 SmtUtils]: Spent 15.79s on a formula simplification. DAG size of input: 216 DAG size of output: 162 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-28 04:53:08,919 INFO L349 Elim1Store]: treesize reduction 414, result has 57.9 percent of original size [2024-11-28 04:53:08,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 4872 treesize of output 4745 [2024-11-28 04:53:09,397 INFO L224 Elim1Store]: Index analysis took 288 ms [2024-11-28 04:53:10,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:53:10,994 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 622 treesize of output 650 [2024-11-28 04:53:11,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:53:11,388 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 641 treesize of output 497 [2024-11-28 04:53:11,797 INFO L224 Elim1Store]: Index analysis took 283 ms [2024-11-28 04:53:13,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:53:13,354 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 534 treesize of output 520 [2024-11-28 04:53:13,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:53:13,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 361 treesize of output 263