./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-patterns/array1_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-patterns/array1_pattern.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 f9fbee177c3231db1a1e3277e649158ac81edd180968ad454e1d0751d0f1d4e9 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:04:00,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:04:00,670 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:04:00,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:04:00,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:04:00,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:04:00,730 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:04:00,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:04:00,732 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:04:00,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:04:00,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:04:00,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:04:00,739 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:04:00,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:04:00,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:04:00,742 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:04:00,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:04:00,742 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:04:00,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:04:00,743 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:04:00,744 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:04:00,744 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:04:00,745 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:04:00,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:04:00,745 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:04:00,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:04:00,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:04:00,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:04:00,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:04:00,748 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:04:00,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:04:00,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:04:00,750 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:04:00,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:04:00,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:04:00,751 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:04:00,751 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:04:00,751 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:04:00,751 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:04:00,751 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> f9fbee177c3231db1a1e3277e649158ac81edd180968ad454e1d0751d0f1d4e9 [2023-11-06 22:04:01,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:04:01,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:04:01,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:04:01,087 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:04:01,087 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:04:01,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/array-patterns/array1_pattern.c [2023-11-06 22:04:04,161 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:04:04,374 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:04:04,375 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/sv-benchmarks/c/array-patterns/array1_pattern.c [2023-11-06 22:04:04,385 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/data/e495969c0/83c8afcd615a4045a40efd8385e3b890/FLAG28d6aa655 [2023-11-06 22:04:04,406 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/data/e495969c0/83c8afcd615a4045a40efd8385e3b890 [2023-11-06 22:04:04,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:04:04,418 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:04:04,422 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:04:04,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:04:04,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:04:04,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:04:04" (1/1) ... [2023-11-06 22:04:04,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1051a7d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:04, skipping insertion in model container [2023-11-06 22:04:04,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:04:04" (1/1) ... [2023-11-06 22:04:04,459 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:04:04,627 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/sv-benchmarks/c/array-patterns/array1_pattern.c[1307,1320] [2023-11-06 22:04:04,656 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:04:04,665 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:04:04,679 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/sv-benchmarks/c/array-patterns/array1_pattern.c[1307,1320] [2023-11-06 22:04:04,688 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:04:04,703 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:04:04,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:04 WrapperNode [2023-11-06 22:04:04,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:04:04,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:04:04,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:04:04,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:04:04,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:04" (1/1) ... [2023-11-06 22:04:04,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:04" (1/1) ... [2023-11-06 22:04:04,743 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2023-11-06 22:04:04,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:04:04,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:04:04,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:04:04,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:04:04,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:04" (1/1) ... [2023-11-06 22:04:04,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:04" (1/1) ... [2023-11-06 22:04:04,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:04" (1/1) ... [2023-11-06 22:04:04,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:04" (1/1) ... [2023-11-06 22:04:04,762 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:04" (1/1) ... [2023-11-06 22:04:04,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:04" (1/1) ... [2023-11-06 22:04:04,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:04" (1/1) ... [2023-11-06 22:04:04,775 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:04" (1/1) ... [2023-11-06 22:04:04,777 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:04:04,778 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:04:04,779 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:04:04,779 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:04:04,780 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:04" (1/1) ... [2023-11-06 22:04:04,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:04:04,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:04:04,826 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:04:04,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:04:04,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:04:04,862 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:04:04,862 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:04:04,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:04:04,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:04:04,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:04:04,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:04:04,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:04:04,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:04:04,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:04:04,932 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:04:04,934 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:04:05,251 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:04:05,258 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:04:05,258 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-06 22:04:05,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:04:05 BoogieIcfgContainer [2023-11-06 22:04:05,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:04:05,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:04:05,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:04:05,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:04:05,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:04:04" (1/3) ... [2023-11-06 22:04:05,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a7e18c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:04:05, skipping insertion in model container [2023-11-06 22:04:05,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:04" (2/3) ... [2023-11-06 22:04:05,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a7e18c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:04:05, skipping insertion in model container [2023-11-06 22:04:05,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:04:05" (3/3) ... [2023-11-06 22:04:05,270 INFO L112 eAbstractionObserver]: Analyzing ICFG array1_pattern.c [2023-11-06 22:04:05,314 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:04:05,314 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:04:05,361 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:04:05,369 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@179e71, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:04:05,369 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:04:05,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:04:05,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-06 22:04:05,383 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:04:05,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:04:05,385 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:04:05,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:04:05,392 INFO L85 PathProgramCache]: Analyzing trace with hash -800294020, now seen corresponding path program 1 times [2023-11-06 22:04:05,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:04:05,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563579374] [2023-11-06 22:04:05,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:05,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:04:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:05,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:04:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:05,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:04:05,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:04:05,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563579374] [2023-11-06 22:04:05,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563579374] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:04:05,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:04:05,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:04:05,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373406713] [2023-11-06 22:04:05,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:04:05,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:04:05,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:04:05,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:04:05,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:04:05,609 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:04:05,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:04:05,639 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2023-11-06 22:04:05,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:04:05,643 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-11-06 22:04:05,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:04:05,652 INFO L225 Difference]: With dead ends: 47 [2023-11-06 22:04:05,652 INFO L226 Difference]: Without dead ends: 21 [2023-11-06 22:04:05,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:04:05,661 INFO L413 NwaCegarLoop]: 28 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, 28 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 [2023-11-06 22:04:05,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:04:05,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-06 22:04:05,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-11-06 22:04:05,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:04:05,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-11-06 22:04:05,708 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2023-11-06 22:04:05,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:04:05,709 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-11-06 22:04:05,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:04:05,710 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-11-06 22:04:05,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 22:04:05,713 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:04:05,713 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:04:05,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:04:05,714 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:04:05,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:04:05,717 INFO L85 PathProgramCache]: Analyzing trace with hash -952637313, now seen corresponding path program 1 times [2023-11-06 22:04:05,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:04:05,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193927337] [2023-11-06 22:04:05,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:05,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:04:05,793 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:04:05,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1557708512] [2023-11-06 22:04:05,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:05,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:04:05,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:04:05,801 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:04:05,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:04:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:05,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:04:05,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:04:06,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:04:06,047 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:04:06,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:04:06,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193927337] [2023-11-06 22:04:06,048 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:04:06,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557708512] [2023-11-06 22:04:06,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557708512] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:04:06,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:04:06,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:04:06,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671427954] [2023-11-06 22:04:06,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:04:06,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:04:06,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:04:06,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:04:06,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:04:06,060 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:04:06,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:04:06,103 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2023-11-06 22:04:06,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:04:06,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-11-06 22:04:06,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:04:06,107 INFO L225 Difference]: With dead ends: 26 [2023-11-06 22:04:06,107 INFO L226 Difference]: Without dead ends: 22 [2023-11-06 22:04:06,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:04:06,110 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:04:06,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 54 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:04:06,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-06 22:04:06,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-06 22:04:06,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:04:06,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-11-06 22:04:06,126 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 22 [2023-11-06 22:04:06,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:04:06,128 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-11-06 22:04:06,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:04:06,128 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-11-06 22:04:06,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 22:04:06,130 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:04:06,130 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:04:06,141 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:04:06,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:04:06,342 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:04:06,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:04:06,343 INFO L85 PathProgramCache]: Analyzing trace with hash -603190335, now seen corresponding path program 1 times [2023-11-06 22:04:06,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:04:06,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707606145] [2023-11-06 22:04:06,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:06,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:04:06,382 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:04:06,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1910780548] [2023-11-06 22:04:06,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:06,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:04:06,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:04:06,387 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:04:06,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:04:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:06,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:04:06,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:04:06,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:04:06,525 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:04:06,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:04:06,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707606145] [2023-11-06 22:04:06,526 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:04:06,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910780548] [2023-11-06 22:04:06,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910780548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:04:06,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:04:06,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:04:06,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455141271] [2023-11-06 22:04:06,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:04:06,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:04:06,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:04:06,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:04:06,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:04:06,530 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:04:06,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:04:06,602 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2023-11-06 22:04:06,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:04:06,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-11-06 22:04:06,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:04:06,604 INFO L225 Difference]: With dead ends: 41 [2023-11-06 22:04:06,604 INFO L226 Difference]: Without dead ends: 25 [2023-11-06 22:04:06,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:04:06,606 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:04:06,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 62 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:04:06,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-06 22:04:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-11-06 22:04:06,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:04:06,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-11-06 22:04:06,613 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 24 [2023-11-06 22:04:06,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:04:06,613 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-11-06 22:04:06,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:04:06,614 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-11-06 22:04:06,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-06 22:04:06,615 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:04:06,615 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:04:06,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:04:06,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:04:06,821 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:04:06,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:04:06,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1366149955, now seen corresponding path program 1 times [2023-11-06 22:04:06,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:04:06,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612346752] [2023-11-06 22:04:06,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:06,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:04:06,851 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:04:06,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1319129934] [2023-11-06 22:04:06,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:06,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:04:06,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:04:06,853 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:04:06,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2057d78e-3ca2-4aaf-8bd4-f6b52d22fc0f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:04:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:06,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-06 22:04:06,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:04:07,089 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 22:04:07,199 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-11-06 22:04:07,227 INFO L351 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 0 case distinctions, treesize of input 34 treesize of output 33 [2023-11-06 22:04:07,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:07,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:04:08,021 INFO L322 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2023-11-06 22:04:08,022 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 54 [2023-11-06 22:04:08,056 INFO L322 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2023-11-06 22:04:08,057 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 41 [2023-11-06 22:04:08,065 INFO L351 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 0 case distinctions, treesize of input 24 treesize of output 23 [2023-11-06 22:04:08,084 INFO L351 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 8 treesize of output 7 [2023-11-06 22:04:08,125 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:04:08,125 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 18 [2023-11-06 22:04:08,136 INFO L351 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 8 treesize of output 7 [2023-11-06 22:04:08,145 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 22:04:08,368 INFO L322 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2023-11-06 22:04:08,368 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 46 [2023-11-06 22:04:08,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:04:08,441 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:04:14,721 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse12 (mod (+ c_~ARR_SIZE~0 4294967295) 4294967296))) (let ((.cse5 (* .cse12 4)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (forall ((v_z_4 Int)) (let ((.cse0 (+ .cse12 v_z_4))) (or (< 6442450943 .cse0) (< .cse0 4294967296) (< 4294967295 v_z_4) (forall ((v_y_4 Int)) (let ((.cse9 (* v_y_4 4294967296)) (.cse10 (* 4294967295 v_z_4))) (let ((.cse8 (+ .cse9 .cse10))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse11 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* 17179869180 v_z_4) (* 17179869184 v_y_4)) (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| .cse8))))) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (* v_z_4 4)) (.cse6 (* |c_ULTIMATE.start_main_~num~0#1| .cse8))) (or (= (let ((.cse2 (store .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse4 .cse5) .cse6))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse2) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse2 |c_ULTIMATE.start_main_~#array2~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1|)) 0) (= (let ((.cse7 (store .cse3 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse4 .cse5) .cse6))) (+ (select .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select (select (store .cse1 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse7) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) 0) (< .cse8 0) (< c_~ARR_SIZE~0 (+ .cse9 .cse10 1))))))))))) (forall ((v_z_1 Int)) (or (< (+ .cse12 v_z_1) 6442450944) (forall ((v_y_1 Int)) (let ((.cse13 (* 4294967295 v_z_1)) (.cse14 (* v_y_1 4294967296))) (let ((.cse15 (+ .cse13 .cse14))) (or (< c_~ARR_SIZE~0 (+ .cse13 .cse14 1)) (< .cse15 0) (= (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse11 (+ (* 17179869180 v_z_1) (* 17179869184 v_y_1) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (* .cse15 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))))) (let ((.cse17 (store (select .cse16 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ (* v_z_1 4) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse5 (- 34359738368)) (* .cse15 |c_ULTIMATE.start_main_~num~0#1|)))) (+ |c_ULTIMATE.start_main_~sum~0#1| (select (select (store .cse16 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse17) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse17 |c_ULTIMATE.start_main_~#array2~0#1.offset|)))) 0))))) (< 4294967295 v_z_1))) (forall ((v_z_1 Int)) (let ((.cse27 (+ .cse12 v_z_1))) (or (< v_z_1 0) (forall ((v_y_1 Int)) (let ((.cse18 (* 4294967295 v_z_1)) (.cse19 (* v_y_1 4294967296))) (let ((.cse25 (+ .cse18 .cse19))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse11 (+ (* 17179869180 v_z_1) (* 17179869184 v_y_1) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (* .cse25 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))))) (let ((.cse22 (select .cse20 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse23 (* v_z_1 4)) (.cse24 (* .cse25 |c_ULTIMATE.start_main_~num~0#1|))) (or (< c_~ARR_SIZE~0 (+ .cse18 .cse19 1)) (= (let ((.cse21 (store .cse22 (+ .cse23 (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse5) .cse24))) (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse21) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse21 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) 0) (< .cse25 0) (= (let ((.cse26 (store .cse22 (+ .cse23 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse5 (- 34359738368)) .cse24))) (+ |c_ULTIMATE.start_main_~sum~0#1| (select (select (store .cse20 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse26) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse26 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) 0))))))) (< .cse27 2147483648) (< 4294967295 .cse27)))) (forall ((v_z_1 Int)) (let ((.cse33 (+ .cse12 v_z_1))) (or (forall ((v_y_1 Int)) (let ((.cse28 (* 4294967295 v_z_1)) (.cse29 (* v_y_1 4294967296))) (let ((.cse32 (+ .cse28 .cse29))) (or (< c_~ARR_SIZE~0 (+ .cse28 .cse29 1)) (= (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse11 (+ (* 17179869180 v_z_1) (* 17179869184 v_y_1) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (* .cse32 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))))) (let ((.cse31 (store (select .cse30 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ (* v_z_1 4) (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse5) (* .cse32 |c_ULTIMATE.start_main_~num~0#1|)))) (+ (select (select (store .cse30 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse31) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse31 |c_ULTIMATE.start_main_~#array2~0#1.offset|)))) 0) (< .cse32 0))))) (< v_z_1 0) (< .cse33 2147483648) (< 4294967295 .cse33)))) (forall ((v_z_4 Int)) (or (< 2147483647 (+ .cse12 v_z_4)) (< v_z_4 0) (forall ((v_y_4 Int)) (let ((.cse41 (* v_y_4 4294967296)) (.cse42 (* 4294967295 v_z_4))) (let ((.cse40 (+ .cse41 .cse42))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse11 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* 17179869180 v_z_4) (* 17179869184 v_y_4)) (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| .cse40))))) (let ((.cse36 (select .cse34 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse37 (* v_z_4 4)) (.cse38 (* |c_ULTIMATE.start_main_~num~0#1| .cse40))) (or (= (let ((.cse35 (store .cse36 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse37 .cse5) .cse38))) (+ (select (select (store .cse34 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse35) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse35 |c_ULTIMATE.start_main_~#array2~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1|)) 0) (= (let ((.cse39 (store .cse36 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse37 .cse5) .cse38))) (+ (select .cse39 |c_ULTIMATE.start_main_~#array2~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select (select (store .cse34 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse39) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) 0) (< .cse40 0) (< c_~ARR_SIZE~0 (+ .cse41 .cse42 1)))))))))) (forall ((v_z_4 Int)) (or (forall ((v_y_4 Int)) (let ((.cse46 (* v_y_4 4294967296)) (.cse47 (* 4294967295 v_z_4))) (let ((.cse45 (+ .cse46 .cse47))) (or (= (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse11 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* 17179869180 v_z_4) (* 17179869184 v_y_4)) (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| .cse45))))) (let ((.cse44 (store (select .cse43 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| (* v_z_4 4) .cse5) (* |c_ULTIMATE.start_main_~num~0#1| .cse45)))) (+ (select (select (store .cse43 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse44) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse44 |c_ULTIMATE.start_main_~#array2~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1|))) 0) (< .cse45 0) (< c_~ARR_SIZE~0 (+ .cse46 .cse47 1)))))) (< 2147483647 (+ .cse12 v_z_4)) (< v_z_4 0))) (forall ((v_z_4 Int)) (let ((.cse48 (+ .cse12 v_z_4))) (or (< 6442450943 .cse48) (< .cse48 4294967296) (< 4294967295 v_z_4) (forall ((v_y_4 Int)) (let ((.cse52 (* v_y_4 4294967296)) (.cse53 (* 4294967295 v_z_4))) (let ((.cse51 (+ .cse52 .cse53))) (or (= (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse11 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* 17179869180 v_z_4) (* 17179869184 v_y_4)) (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| .cse51))))) (let ((.cse49 (store (select .cse50 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| (* v_z_4 4) .cse5) (* |c_ULTIMATE.start_main_~num~0#1| .cse51)))) (+ (select .cse49 |c_ULTIMATE.start_main_~#array2~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select (select (store .cse50 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse49) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)))) 0) (< .cse51 0) (< c_~ARR_SIZE~0 (+ .cse52 .cse53 1))))))))) (forall ((v_z_1 Int)) (or (< (+ .cse12 v_z_1) 6442450944) (forall ((v_y_1 Int)) (let ((.cse54 (* 4294967295 v_z_1)) (.cse55 (* v_y_1 4294967296))) (let ((.cse61 (+ .cse54 .cse55))) (let ((.cse56 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse11 (+ (* 17179869180 v_z_1) (* 17179869184 v_y_1) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (* .cse61 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))))) (let ((.cse58 (select .cse56 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse59 (* v_z_1 4)) (.cse60 (* .cse61 |c_ULTIMATE.start_main_~num~0#1|))) (or (< c_~ARR_SIZE~0 (+ .cse54 .cse55 1)) (= (let ((.cse57 (store .cse58 (+ .cse59 (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse5) .cse60))) (+ (select (select (store .cse56 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse57) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse57 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) 0) (< .cse61 0) (= (let ((.cse62 (store .cse58 (+ .cse59 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse5 (- 34359738368)) .cse60))) (+ |c_ULTIMATE.start_main_~sum~0#1| (select (select (store .cse56 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse62) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse62 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) 0))))))) (< 4294967295 v_z_1)))))) is different from true [2023-11-06 22:04:19,689 WARN L861 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_main_~count~0#1| c_~ARR_SIZE~0) (let ((.cse12 (mod (+ c_~ARR_SIZE~0 4294967295) 4294967296))) (let ((.cse5 (* .cse12 4)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (forall ((v_z_4 Int)) (let ((.cse0 (+ .cse12 v_z_4))) (or (< 6442450943 .cse0) (< .cse0 4294967296) (< 4294967295 v_z_4) (forall ((v_y_4 Int)) (let ((.cse9 (* v_y_4 4294967296)) (.cse10 (* 4294967295 v_z_4))) (let ((.cse8 (+ .cse9 .cse10))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse11 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* 17179869180 v_z_4) (* 17179869184 v_y_4)) (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| .cse8))))) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (* v_z_4 4)) (.cse6 (* |c_ULTIMATE.start_main_~num~0#1| .cse8))) (or (= (let ((.cse2 (store .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse4 .cse5) .cse6))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse2) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse2 |c_ULTIMATE.start_main_~#array2~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1|)) 0) (= (let ((.cse7 (store .cse3 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse4 .cse5) .cse6))) (+ (select .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select (select (store .cse1 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse7) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) 0) (< .cse8 0) (< c_~ARR_SIZE~0 (+ .cse9 .cse10 1))))))))))) (forall ((v_z_1 Int)) (or (< (+ .cse12 v_z_1) 6442450944) (forall ((v_y_1 Int)) (let ((.cse13 (* 4294967295 v_z_1)) (.cse14 (* v_y_1 4294967296))) (let ((.cse15 (+ .cse13 .cse14))) (or (< c_~ARR_SIZE~0 (+ .cse13 .cse14 1)) (< .cse15 0) (= (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse11 (+ (* 17179869180 v_z_1) (* 17179869184 v_y_1) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (* .cse15 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))))) (let ((.cse17 (store (select .cse16 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ (* v_z_1 4) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse5 (- 34359738368)) (* .cse15 |c_ULTIMATE.start_main_~num~0#1|)))) (+ |c_ULTIMATE.start_main_~sum~0#1| (select (select (store .cse16 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse17) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse17 |c_ULTIMATE.start_main_~#array2~0#1.offset|)))) 0))))) (< 4294967295 v_z_1))) (forall ((v_z_1 Int)) (let ((.cse27 (+ .cse12 v_z_1))) (or (< v_z_1 0) (forall ((v_y_1 Int)) (let ((.cse18 (* 4294967295 v_z_1)) (.cse19 (* v_y_1 4294967296))) (let ((.cse25 (+ .cse18 .cse19))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse11 (+ (* 17179869180 v_z_1) (* 17179869184 v_y_1) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (* .cse25 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))))) (let ((.cse22 (select .cse20 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse23 (* v_z_1 4)) (.cse24 (* .cse25 |c_ULTIMATE.start_main_~num~0#1|))) (or (< c_~ARR_SIZE~0 (+ .cse18 .cse19 1)) (= (let ((.cse21 (store .cse22 (+ .cse23 (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse5) .cse24))) (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse21) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse21 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) 0) (< .cse25 0) (= (let ((.cse26 (store .cse22 (+ .cse23 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse5 (- 34359738368)) .cse24))) (+ |c_ULTIMATE.start_main_~sum~0#1| (select (select (store .cse20 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse26) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse26 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) 0))))))) (< .cse27 2147483648) (< 4294967295 .cse27)))) (forall ((v_z_1 Int)) (let ((.cse33 (+ .cse12 v_z_1))) (or (forall ((v_y_1 Int)) (let ((.cse28 (* 4294967295 v_z_1)) (.cse29 (* v_y_1 4294967296))) (let ((.cse32 (+ .cse28 .cse29))) (or (< c_~ARR_SIZE~0 (+ .cse28 .cse29 1)) (= (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse11 (+ (* 17179869180 v_z_1) (* 17179869184 v_y_1) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (* .cse32 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))))) (let ((.cse31 (store (select .cse30 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ (* v_z_1 4) (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse5) (* .cse32 |c_ULTIMATE.start_main_~num~0#1|)))) (+ (select (select (store .cse30 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse31) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse31 |c_ULTIMATE.start_main_~#array2~0#1.offset|)))) 0) (< .cse32 0))))) (< v_z_1 0) (< .cse33 2147483648) (< 4294967295 .cse33)))) (forall ((v_z_4 Int)) (or (< 2147483647 (+ .cse12 v_z_4)) (< v_z_4 0) (forall ((v_y_4 Int)) (let ((.cse41 (* v_y_4 4294967296)) (.cse42 (* 4294967295 v_z_4))) (let ((.cse40 (+ .cse41 .cse42))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse11 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* 17179869180 v_z_4) (* 17179869184 v_y_4)) (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| .cse40))))) (let ((.cse36 (select .cse34 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse37 (* v_z_4 4)) (.cse38 (* |c_ULTIMATE.start_main_~num~0#1| .cse40))) (or (= (let ((.cse35 (store .cse36 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse37 .cse5) .cse38))) (+ (select (select (store .cse34 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse35) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse35 |c_ULTIMATE.start_main_~#array2~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1|)) 0) (= (let ((.cse39 (store .cse36 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse37 .cse5) .cse38))) (+ (select .cse39 |c_ULTIMATE.start_main_~#array2~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select (select (store .cse34 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse39) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) 0) (< .cse40 0) (< c_~ARR_SIZE~0 (+ .cse41 .cse42 1)))))))))) (forall ((v_z_4 Int)) (or (forall ((v_y_4 Int)) (let ((.cse46 (* v_y_4 4294967296)) (.cse47 (* 4294967295 v_z_4))) (let ((.cse45 (+ .cse46 .cse47))) (or (= (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse11 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* 17179869180 v_z_4) (* 17179869184 v_y_4)) (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| .cse45))))) (let ((.cse44 (store (select .cse43 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| (* v_z_4 4) .cse5) (* |c_ULTIMATE.start_main_~num~0#1| .cse45)))) (+ (select (select (store .cse43 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse44) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse44 |c_ULTIMATE.start_main_~#array2~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1|))) 0) (< .cse45 0) (< c_~ARR_SIZE~0 (+ .cse46 .cse47 1)))))) (< 2147483647 (+ .cse12 v_z_4)) (< v_z_4 0))) (forall ((v_z_4 Int)) (let ((.cse48 (+ .cse12 v_z_4))) (or (< 6442450943 .cse48) (< .cse48 4294967296) (< 4294967295 v_z_4) (forall ((v_y_4 Int)) (let ((.cse52 (* v_y_4 4294967296)) (.cse53 (* 4294967295 v_z_4))) (let ((.cse51 (+ .cse52 .cse53))) (or (= (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse11 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* 17179869180 v_z_4) (* 17179869184 v_y_4)) (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| .cse51))))) (let ((.cse49 (store (select .cse50 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| (* v_z_4 4) .cse5) (* |c_ULTIMATE.start_main_~num~0#1| .cse51)))) (+ (select .cse49 |c_ULTIMATE.start_main_~#array2~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select (select (store .cse50 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse49) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)))) 0) (< .cse51 0) (< c_~ARR_SIZE~0 (+ .cse52 .cse53 1))))))))) (forall ((v_z_1 Int)) (or (< (+ .cse12 v_z_1) 6442450944) (forall ((v_y_1 Int)) (let ((.cse54 (* 4294967295 v_z_1)) (.cse55 (* v_y_1 4294967296))) (let ((.cse61 (+ .cse54 .cse55))) (let ((.cse56 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse11 (+ (* 17179869180 v_z_1) (* 17179869184 v_y_1) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (* .cse61 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))))) (let ((.cse58 (select .cse56 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse59 (* v_z_1 4)) (.cse60 (* .cse61 |c_ULTIMATE.start_main_~num~0#1|))) (or (< c_~ARR_SIZE~0 (+ .cse54 .cse55 1)) (= (let ((.cse57 (store .cse58 (+ .cse59 (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse5) .cse60))) (+ (select (select (store .cse56 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse57) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse57 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) 0) (< .cse61 0) (= (let ((.cse62 (store .cse58 (+ .cse59 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse5 (- 34359738368)) .cse60))) (+ |c_ULTIMATE.start_main_~sum~0#1| (select (select (store .cse56 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse62) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse62 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) 0))))))) (< 4294967295 v_z_1))))))) is different from true [2023-11-06 22:04:24,784 WARN L861 $PredicateComparison]: unable to prove that (or (< (+ |c_ULTIMATE.start_main_~count~0#1| 1) c_~ARR_SIZE~0) (let ((.cse12 (mod (+ c_~ARR_SIZE~0 4294967295) 4294967296))) (let ((.cse5 (* .cse12 4)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (forall ((v_z_4 Int)) (let ((.cse0 (+ .cse12 v_z_4))) (or (< 6442450943 .cse0) (< .cse0 4294967296) (< 4294967295 v_z_4) (forall ((v_y_4 Int)) (let ((.cse9 (* v_y_4 4294967296)) (.cse10 (* 4294967295 v_z_4))) (let ((.cse8 (+ .cse9 .cse10))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse11 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* 17179869180 v_z_4) (* 17179869184 v_y_4)) (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| .cse8))))) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse4 (* v_z_4 4)) (.cse6 (* |c_ULTIMATE.start_main_~num~0#1| .cse8))) (or (= (let ((.cse2 (store .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse4 .cse5) .cse6))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse2) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse2 |c_ULTIMATE.start_main_~#array2~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1|)) 0) (= (let ((.cse7 (store .cse3 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse4 .cse5) .cse6))) (+ (select .cse7 |c_ULTIMATE.start_main_~#array2~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select (select (store .cse1 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse7) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) 0) (< .cse8 0) (< c_~ARR_SIZE~0 (+ .cse9 .cse10 1))))))))))) (forall ((v_z_1 Int)) (or (< (+ .cse12 v_z_1) 6442450944) (forall ((v_y_1 Int)) (let ((.cse13 (* 4294967295 v_z_1)) (.cse14 (* v_y_1 4294967296))) (let ((.cse15 (+ .cse13 .cse14))) (or (< c_~ARR_SIZE~0 (+ .cse13 .cse14 1)) (< .cse15 0) (= (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse11 (+ (* 17179869180 v_z_1) (* 17179869184 v_y_1) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (* .cse15 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))))) (let ((.cse17 (store (select .cse16 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ (* v_z_1 4) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse5 (- 34359738368)) (* .cse15 |c_ULTIMATE.start_main_~num~0#1|)))) (+ |c_ULTIMATE.start_main_~sum~0#1| (select (select (store .cse16 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse17) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse17 |c_ULTIMATE.start_main_~#array2~0#1.offset|)))) 0))))) (< 4294967295 v_z_1))) (forall ((v_z_1 Int)) (let ((.cse27 (+ .cse12 v_z_1))) (or (< v_z_1 0) (forall ((v_y_1 Int)) (let ((.cse18 (* 4294967295 v_z_1)) (.cse19 (* v_y_1 4294967296))) (let ((.cse25 (+ .cse18 .cse19))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse11 (+ (* 17179869180 v_z_1) (* 17179869184 v_y_1) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (* .cse25 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))))) (let ((.cse22 (select .cse20 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse23 (* v_z_1 4)) (.cse24 (* .cse25 |c_ULTIMATE.start_main_~num~0#1|))) (or (< c_~ARR_SIZE~0 (+ .cse18 .cse19 1)) (= (let ((.cse21 (store .cse22 (+ .cse23 (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse5) .cse24))) (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse21) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse21 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) 0) (< .cse25 0) (= (let ((.cse26 (store .cse22 (+ .cse23 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse5 (- 34359738368)) .cse24))) (+ |c_ULTIMATE.start_main_~sum~0#1| (select (select (store .cse20 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse26) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse26 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) 0))))))) (< .cse27 2147483648) (< 4294967295 .cse27)))) (forall ((v_z_1 Int)) (let ((.cse33 (+ .cse12 v_z_1))) (or (forall ((v_y_1 Int)) (let ((.cse28 (* 4294967295 v_z_1)) (.cse29 (* v_y_1 4294967296))) (let ((.cse32 (+ .cse28 .cse29))) (or (< c_~ARR_SIZE~0 (+ .cse28 .cse29 1)) (= (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse11 (+ (* 17179869180 v_z_1) (* 17179869184 v_y_1) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (* .cse32 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))))) (let ((.cse31 (store (select .cse30 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ (* v_z_1 4) (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse5) (* .cse32 |c_ULTIMATE.start_main_~num~0#1|)))) (+ (select (select (store .cse30 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse31) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse31 |c_ULTIMATE.start_main_~#array2~0#1.offset|)))) 0) (< .cse32 0))))) (< v_z_1 0) (< .cse33 2147483648) (< 4294967295 .cse33)))) (forall ((v_z_4 Int)) (or (< 2147483647 (+ .cse12 v_z_4)) (< v_z_4 0) (forall ((v_y_4 Int)) (let ((.cse41 (* v_y_4 4294967296)) (.cse42 (* 4294967295 v_z_4))) (let ((.cse40 (+ .cse41 .cse42))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse11 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* 17179869180 v_z_4) (* 17179869184 v_y_4)) (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| .cse40))))) (let ((.cse36 (select .cse34 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse37 (* v_z_4 4)) (.cse38 (* |c_ULTIMATE.start_main_~num~0#1| .cse40))) (or (= (let ((.cse35 (store .cse36 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse37 .cse5) .cse38))) (+ (select (select (store .cse34 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse35) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse35 |c_ULTIMATE.start_main_~#array2~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1|)) 0) (= (let ((.cse39 (store .cse36 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse37 .cse5) .cse38))) (+ (select .cse39 |c_ULTIMATE.start_main_~#array2~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select (select (store .cse34 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse39) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) 0) (< .cse40 0) (< c_~ARR_SIZE~0 (+ .cse41 .cse42 1)))))))))) (forall ((v_z_4 Int)) (or (forall ((v_y_4 Int)) (let ((.cse46 (* v_y_4 4294967296)) (.cse47 (* 4294967295 v_z_4))) (let ((.cse45 (+ .cse46 .cse47))) (or (= (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse11 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* 17179869180 v_z_4) (* 17179869184 v_y_4)) (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| .cse45))))) (let ((.cse44 (store (select .cse43 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| (* v_z_4 4) .cse5) (* |c_ULTIMATE.start_main_~num~0#1| .cse45)))) (+ (select (select (store .cse43 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse44) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse44 |c_ULTIMATE.start_main_~#array2~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1|))) 0) (< .cse45 0) (< c_~ARR_SIZE~0 (+ .cse46 .cse47 1)))))) (< 2147483647 (+ .cse12 v_z_4)) (< v_z_4 0))) (forall ((v_z_4 Int)) (let ((.cse48 (+ .cse12 v_z_4))) (or (< 6442450943 .cse48) (< .cse48 4294967296) (< 4294967295 v_z_4) (forall ((v_y_4 Int)) (let ((.cse52 (* v_y_4 4294967296)) (.cse53 (* 4294967295 v_z_4))) (let ((.cse51 (+ .cse52 .cse53))) (or (= (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse11 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* 17179869180 v_z_4) (* 17179869184 v_y_4)) (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| .cse51))))) (let ((.cse49 (store (select .cse50 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| (* v_z_4 4) .cse5) (* |c_ULTIMATE.start_main_~num~0#1| .cse51)))) (+ (select .cse49 |c_ULTIMATE.start_main_~#array2~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select (select (store .cse50 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse49) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)))) 0) (< .cse51 0) (< c_~ARR_SIZE~0 (+ .cse52 .cse53 1))))))))) (forall ((v_z_1 Int)) (or (< (+ .cse12 v_z_1) 6442450944) (forall ((v_y_1 Int)) (let ((.cse54 (* 4294967295 v_z_1)) (.cse55 (* v_y_1 4294967296))) (let ((.cse61 (+ .cse54 .cse55))) (let ((.cse56 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse11 (+ (* 17179869180 v_z_1) (* 17179869184 v_y_1) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (* .cse61 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|))))) (let ((.cse58 (select .cse56 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse59 (* v_z_1 4)) (.cse60 (* .cse61 |c_ULTIMATE.start_main_~num~0#1|))) (or (< c_~ARR_SIZE~0 (+ .cse54 .cse55 1)) (= (let ((.cse57 (store .cse58 (+ .cse59 (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse5) .cse60))) (+ (select (select (store .cse56 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse57) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select .cse57 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) 0) (< .cse61 0) (= (let ((.cse62 (store .cse58 (+ .cse59 |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse5 (- 34359738368)) .cse60))) (+ |c_ULTIMATE.start_main_~sum~0#1| (select (select (store .cse56 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse62) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse62 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) 0))))))) (< 4294967295 v_z_1))))))) is different from true [2023-11-06 22:04:25,103 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:04:25,104 INFO L351 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 1693 treesize of output 1441 [2023-11-06 22:04:25,393 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:04:25,393 INFO L351 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 377 treesize of output 371 [2023-11-06 22:04:25,437 INFO L351 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 233 treesize of output 229 [2023-11-06 22:04:25,594 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2023-11-06 22:04:26,299 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-06 22:04:26,300 INFO L351 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 23301 treesize of output 23055 [2023-11-06 22:04:47,212 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:04:47,213 INFO L351 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 739 treesize of output 643 [2023-11-06 22:04:47,376 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:04:47,376 INFO L351 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 195 treesize of output 195 [2023-11-06 22:04:47,408 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 114 [2023-11-06 22:04:47,637 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2023-11-06 22:04:47,902 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-06 22:04:47,903 INFO L351 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 5996 treesize of output 5944 [2023-11-06 22:04:54,397 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:04:54,398 INFO L351 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 729 treesize of output 633 [2023-11-06 22:04:54,449 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:04:54,450 INFO L351 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 192 treesize of output 192 [2023-11-06 22:04:54,501 INFO L351 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 114 treesize of output 112 [2023-11-06 22:04:54,859 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2023-11-06 22:04:55,034 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:04:55,035 INFO L351 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 86811 treesize of output 85805 [2023-11-06 22:05:21,124 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:05:21,125 INFO L351 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 847 treesize of output 727 [2023-11-06 22:05:21,158 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:05:21,159 INFO L351 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 195 treesize of output 195 [2023-11-06 22:05:21,168 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:05:21,174 INFO L351 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 43 [2023-11-06 22:05:21,215 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2023-11-06 22:05:21,285 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-06 22:05:21,286 INFO L351 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 169485 treesize of output 167451 [2023-11-06 22:05:28,878 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:05:28,878 INFO L351 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 1575 treesize of output 1347 [2023-11-06 22:05:29,000 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:05:29,000 INFO L351 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 374 treesize of output 368 [2023-11-06 22:05:29,012 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:05:29,032 INFO L351 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 90 treesize of output 86 [2023-11-06 22:05:29,073 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2023-11-06 22:05:29,578 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-06 22:05:29,579 INFO L351 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 12468 treesize of output 12322 [2023-11-06 22:05:42,650 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:05:42,650 INFO L351 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 739 treesize of output 643 [2023-11-06 22:05:42,696 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:05:42,697 INFO L351 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 195 treesize of output 195 [2023-11-06 22:05:42,708 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:05:42,773 INFO L351 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 43 [2023-11-06 22:05:42,796 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2023-11-06 22:05:42,886 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-06 22:05:42,887 INFO L351 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 10231 treesize of output 10117 [2023-11-06 22:05:45,415 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:05:45,416 INFO L351 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 1693 treesize of output 1441 [2023-11-06 22:05:45,570 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:05:45,570 INFO L351 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 377 treesize of output 371 [2023-11-06 22:05:45,588 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:05:45,599 INFO L351 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 91 treesize of output 87 [2023-11-06 22:05:45,625 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2023-11-06 22:05:45,720 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-06 22:05:45,721 INFO L351 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 25111 treesize of output 24805 [2023-11-06 22:06:03,600 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:06:03,600 INFO L351 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 1575 treesize of output 1347 [2023-11-06 22:06:03,675 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:06:03,675 INFO L351 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 374 treesize of output 368 [2023-11-06 22:06:03,809 INFO L351 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 231 treesize of output 227 [2023-11-06 22:06:04,212 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2023-11-06 22:06:04,721 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:06:04,722 INFO L351 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 90743 treesize of output 89605