./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.07-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows 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_9cbfc8f8-f34d-44ff-9801-56ed970164f8/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfc8f8-f34d-44ff-9801-56ed970164f8/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_9cbfc8f8-f34d-44ff-9801-56ed970164f8/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfc8f8-f34d-44ff-9801-56ed970164f8/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.07-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfc8f8-f34d-44ff-9801-56ed970164f8/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfc8f8-f34d-44ff-9801-56ed970164f8/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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 93b4a0ba0c9f7effb12d2a47608c061d55502e7c43d58dada73542f7a20a21c1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:01:47,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:01:47,555 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfc8f8-f34d-44ff-9801-56ed970164f8/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-64bit-Automizer_Default.epf [2023-11-06 23:01:47,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:01:47,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:01:47,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:01:47,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:01:47,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:01:47,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:01:47,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:01:47,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:01:47,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:01:47,625 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:01:47,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:01:47,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:01:47,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:01:47,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:01:47,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:01:47,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:01:47,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:01:47,630 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-06 23:01:47,631 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:01:47,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:01:47,632 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:01:47,633 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:01:47,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:01:47,636 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:01:47,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:01:47,637 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:01:47,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:01:47,639 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:01:47,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:01:47,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:01:47,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:01:47,641 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:01:47,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:01:47,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:01:47,641 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:01:47,642 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_9cbfc8f8-f34d-44ff-9801-56ed970164f8/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_9cbfc8f8-f34d-44ff-9801-56ed970164f8/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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93b4a0ba0c9f7effb12d2a47608c061d55502e7c43d58dada73542f7a20a21c1 [2023-11-06 23:01:47,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:01:48,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:01:48,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:01:48,044 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:01:48,045 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:01:48,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfc8f8-f34d-44ff-9801-56ed970164f8/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/termination-memory-alloca/c.07-alloca.i [2023-11-06 23:01:51,364 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:01:51,717 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:01:51,722 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfc8f8-f34d-44ff-9801-56ed970164f8/sv-benchmarks/c/termination-memory-alloca/c.07-alloca.i [2023-11-06 23:01:51,747 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfc8f8-f34d-44ff-9801-56ed970164f8/bin/uautomizer-verify-WvqO1wxjHP/data/bffc30fa5/80c4c7ec28a84676869fbf82c03aa15d/FLAG46d93aa9d [2023-11-06 23:01:51,771 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfc8f8-f34d-44ff-9801-56ed970164f8/bin/uautomizer-verify-WvqO1wxjHP/data/bffc30fa5/80c4c7ec28a84676869fbf82c03aa15d [2023-11-06 23:01:51,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:01:51,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:01:51,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:01:51,784 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:01:51,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:01:51,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:01:51" (1/1) ... [2023-11-06 23:01:51,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fb3e0d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:51, skipping insertion in model container [2023-11-06 23:01:51,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:01:51" (1/1) ... [2023-11-06 23:01:51,857 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:01:52,167 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:01:52,178 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:01:52,220 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:01:52,256 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:01:52,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:52 WrapperNode [2023-11-06 23:01:52,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:01:52,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:01:52,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:01:52,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:01:52,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:52" (1/1) ... [2023-11-06 23:01:52,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:52" (1/1) ... [2023-11-06 23:01:52,331 INFO L138 Inliner]: procedures = 111, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 103 [2023-11-06 23:01:52,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:01:52,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:01:52,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:01:52,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:01:52,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:52" (1/1) ... [2023-11-06 23:01:52,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:52" (1/1) ... [2023-11-06 23:01:52,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:52" (1/1) ... [2023-11-06 23:01:52,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:52" (1/1) ... [2023-11-06 23:01:52,370 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:52" (1/1) ... [2023-11-06 23:01:52,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:52" (1/1) ... [2023-11-06 23:01:52,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:52" (1/1) ... [2023-11-06 23:01:52,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:52" (1/1) ... [2023-11-06 23:01:52,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:01:52,381 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:01:52,381 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:01:52,381 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:01:52,382 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:52" (1/1) ... [2023-11-06 23:01:52,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:01:52,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfc8f8-f34d-44ff-9801-56ed970164f8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:01:52,420 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfc8f8-f34d-44ff-9801-56ed970164f8/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:01:52,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfc8f8-f34d-44ff-9801-56ed970164f8/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:01:52,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 23:01:52,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:01:52,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:01:52,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:01:52,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:01:52,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:01:52,581 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:01:52,582 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:01:52,791 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:01:52,798 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:01:52,798 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 23:01:52,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:01:52 BoogieIcfgContainer [2023-11-06 23:01:52,801 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:01:52,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:01:52,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:01:52,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:01:52,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:01:51" (1/3) ... [2023-11-06 23:01:52,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ccf3147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:01:52, skipping insertion in model container [2023-11-06 23:01:52,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:52" (2/3) ... [2023-11-06 23:01:52,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ccf3147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:01:52, skipping insertion in model container [2023-11-06 23:01:52,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:01:52" (3/3) ... [2023-11-06 23:01:52,811 INFO L112 eAbstractionObserver]: Analyzing ICFG c.07-alloca.i [2023-11-06 23:01:52,833 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:01:52,833 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-11-06 23:01:52,881 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:01:52,888 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;@40c2dff0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:01:52,888 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-06 23:01:52,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:52,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 23:01:52,901 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:52,902 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:52,904 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-06 23:01:52,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:52,912 INFO L85 PathProgramCache]: Analyzing trace with hash 177626378, now seen corresponding path program 1 times [2023-11-06 23:01:52,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:52,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192637282] [2023-11-06 23:01:52,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:52,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:54,515 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 23:01:54,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:54,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192637282] [2023-11-06 23:01:54,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192637282] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:54,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:54,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:01:54,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386338875] [2023-11-06 23:01:54,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:54,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:01:54,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:54,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:01:54,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:01:54,578 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:54,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:54,667 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2023-11-06 23:01:54,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:01:54,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-06 23:01:54,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:54,679 INFO L225 Difference]: With dead ends: 34 [2023-11-06 23:01:54,679 INFO L226 Difference]: Without dead ends: 21 [2023-11-06 23:01:54,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:01:54,687 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:54,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 47 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:01:54,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-06 23:01:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-11-06 23:01:54,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-11-06 23:01:54,728 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 8 [2023-11-06 23:01:54,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:54,729 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-11-06 23:01:54,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:54,730 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-11-06 23:01:54,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 23:01:54,731 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:54,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:54,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:01:54,733 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-06 23:01:54,734 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:54,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1211450481, now seen corresponding path program 1 times [2023-11-06 23:01:54,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:54,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108872110] [2023-11-06 23:01:54,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:54,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:55,158 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 23:01:55,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:55,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108872110] [2023-11-06 23:01:55,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108872110] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:55,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:55,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:01:55,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274865582] [2023-11-06 23:01:55,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:55,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:01:55,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:55,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:01:55,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:01:55,168 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:55,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:55,248 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2023-11-06 23:01:55,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:01:55,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-06 23:01:55,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:55,252 INFO L225 Difference]: With dead ends: 31 [2023-11-06 23:01:55,252 INFO L226 Difference]: Without dead ends: 30 [2023-11-06 23:01:55,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:01:55,260 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 20 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:55,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 23 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:01:55,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-06 23:01:55,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-06 23:01:55,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-11-06 23:01:55,278 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 9 [2023-11-06 23:01:55,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:55,278 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-11-06 23:01:55,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:55,279 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-11-06 23:01:55,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 23:01:55,280 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:55,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:55,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:01:55,280 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-06 23:01:55,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:55,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1268708783, now seen corresponding path program 1 times [2023-11-06 23:01:55,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:55,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455716957] [2023-11-06 23:01:55,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:55,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:55,394 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 23:01:55,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:55,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455716957] [2023-11-06 23:01:55,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455716957] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:55,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:55,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:01:55,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204515177] [2023-11-06 23:01:55,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:55,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:01:55,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:55,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:01:55,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:01:55,397 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:55,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:55,439 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2023-11-06 23:01:55,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:01:55,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-06 23:01:55,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:55,441 INFO L225 Difference]: With dead ends: 49 [2023-11-06 23:01:55,441 INFO L226 Difference]: Without dead ends: 20 [2023-11-06 23:01:55,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:01:55,451 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:55,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 37 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:01:55,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-06 23:01:55,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-06 23:01:55,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:55,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2023-11-06 23:01:55,462 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 9 [2023-11-06 23:01:55,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:55,466 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2023-11-06 23:01:55,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:55,467 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2023-11-06 23:01:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 23:01:55,470 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:55,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:55,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:01:55,471 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-06 23:01:55,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:55,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1099740692, now seen corresponding path program 1 times [2023-11-06 23:01:55,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:55,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981294965] [2023-11-06 23:01:55,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:55,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:56,050 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 23:01:56,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:56,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981294965] [2023-11-06 23:01:56,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981294965] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:56,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:56,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:01:56,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102506258] [2023-11-06 23:01:56,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:56,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:01:56,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:56,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:01:56,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:01:56,054 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:56,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:56,271 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2023-11-06 23:01:56,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 23:01:56,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-06 23:01:56,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:56,273 INFO L225 Difference]: With dead ends: 24 [2023-11-06 23:01:56,273 INFO L226 Difference]: Without dead ends: 23 [2023-11-06 23:01:56,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2023-11-06 23:01:56,275 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 26 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:56,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 17 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:01:56,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-06 23:01:56,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2023-11-06 23:01:56,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:56,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2023-11-06 23:01:56,280 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 10 [2023-11-06 23:01:56,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:56,281 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2023-11-06 23:01:56,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:56,281 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2023-11-06 23:01:56,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 23:01:56,282 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:56,282 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:56,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:01:56,283 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-06 23:01:56,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:56,283 INFO L85 PathProgramCache]: Analyzing trace with hash 267776979, now seen corresponding path program 1 times [2023-11-06 23:01:56,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:56,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050871036] [2023-11-06 23:01:56,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:56,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:56,869 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 23:01:56,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:56,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050871036] [2023-11-06 23:01:56,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050871036] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:56,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:56,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:01:56,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117892591] [2023-11-06 23:01:56,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:56,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:01:56,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:56,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:01:56,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:01:56,875 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:56,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:56,982 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2023-11-06 23:01:56,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:01:56,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-06 23:01:56,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:56,984 INFO L225 Difference]: With dead ends: 22 [2023-11-06 23:01:56,984 INFO L226 Difference]: Without dead ends: 21 [2023-11-06 23:01:56,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:01:56,986 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:56,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 13 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:01:56,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-06 23:01:56,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2023-11-06 23:01:56,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:57,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2023-11-06 23:01:57,000 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2023-11-06 23:01:57,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:57,000 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2023-11-06 23:01:57,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:57,001 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2023-11-06 23:01:57,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-06 23:01:57,002 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:57,002 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:57,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:01:57,002 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-06 23:01:57,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:57,003 INFO L85 PathProgramCache]: Analyzing trace with hash -375243685, now seen corresponding path program 1 times [2023-11-06 23:01:57,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:57,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703586616] [2023-11-06 23:01:57,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:57,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:58,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:58,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:58,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703586616] [2023-11-06 23:01:58,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703586616] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:01:58,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167071600] [2023-11-06 23:01:58,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:58,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:01:58,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfc8f8-f34d-44ff-9801-56ed970164f8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:01:58,695 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfc8f8-f34d-44ff-9801-56ed970164f8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:01:58,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfc8f8-f34d-44ff-9801-56ed970164f8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 23:01:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:58,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-06 23:01:58,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:01:59,025 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-06 23:01:59,026 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 151 [2023-11-06 23:01:59,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:59,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:59,152 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:01:59,225 INFO L322 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-11-06 23:01:59,226 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 85 [2023-11-06 23:01:59,290 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 25 treesize of output 19 [2023-11-06 23:01:59,315 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 12 treesize of output 11 [2023-11-06 23:01:59,384 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 12 treesize of output 1 [2023-11-06 23:01:59,422 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:01:59,430 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 24 [2023-11-06 23:01:59,442 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 9 treesize of output 7 [2023-11-06 23:01:59,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:59,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:59,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:59,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:59,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:59,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:59,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:59,667 INFO L322 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-11-06 23:01:59,674 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 104 [2023-11-06 23:01:59,705 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 25 treesize of output 7 [2023-11-06 23:01:59,727 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 12 treesize of output 11 [2023-11-06 23:01:59,773 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:01:59,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:59,800 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:01:59,805 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 20 [2023-11-06 23:01:59,813 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 9 treesize of output 7 [2023-11-06 23:01:59,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:59,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:59,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:59,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:59,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:00,019 INFO L322 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-11-06 23:02:00,020 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 112 [2023-11-06 23:02:00,040 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 12 treesize of output 1 [2023-11-06 23:02:00,058 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 25 treesize of output 19 [2023-11-06 23:02:00,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:00,103 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 23:02:00,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:00,180 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:00,185 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 39 [2023-11-06 23:02:00,197 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 20 treesize of output 16 [2023-11-06 23:02:00,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:00,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:00,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:00,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:00,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:00,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:00,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:01,145 INFO L322 Elim1Store]: treesize reduction 210, result has 38.1 percent of original size [2023-11-06 23:02:01,146 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 630 treesize of output 717 [2023-11-06 23:02:01,374 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 25 treesize of output 7 [2023-11-06 23:02:02,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:02,465 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:02,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:02,516 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:02,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:02,529 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:02,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:02,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:02,546 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:02,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:02,557 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:02,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:02,580 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:02,601 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:02,602 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:02,602 INFO L217 Elim1Store]: Index analysis took 143 ms [2023-11-06 23:02:02,645 INFO L322 Elim1Store]: treesize reduction 37, result has 17.8 percent of original size [2023-11-06 23:02:02,646 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 123 treesize of output 123 [2023-11-06 23:02:02,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:02,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:03,039 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,088 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,102 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,118 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,127 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,147 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,155 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,155 INFO L217 Elim1Store]: Index analysis took 196 ms [2023-11-06 23:02:03,199 INFO L322 Elim1Store]: treesize reduction 37, result has 17.8 percent of original size [2023-11-06 23:02:03,199 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 128 treesize of output 126 [2023-11-06 23:02:03,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:03,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:03,637 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,672 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,682 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,689 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,746 INFO L322 Elim1Store]: treesize reduction 48, result has 26.2 percent of original size [2023-11-06 23:02:03,747 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 104 treesize of output 82 [2023-11-06 23:02:03,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:03,826 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:03,850 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:03,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:03,861 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:03,867 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,868 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,871 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 59 [2023-11-06 23:02:04,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:04,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:04,171 INFO L322 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2023-11-06 23:02:04,172 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 78 [2023-11-06 23:02:04,427 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:04,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:04,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:04,431 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:04,435 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 21 [2023-11-06 23:02:04,690 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 12 treesize of output 11 [2023-11-06 23:02:04,869 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 366 treesize of output 315 [2023-11-06 23:02:05,299 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 823 treesize of output 809 [2023-11-06 23:02:06,251 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 0 case distinctions, treesize of input 18 treesize of output 3 [2023-11-06 23:02:06,597 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 0 case distinctions, treesize of input 18 treesize of output 3 [2023-11-06 23:02:07,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:07,961 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:07,966 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 35 [2023-11-06 23:02:07,978 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 15 treesize of output 11 [2023-11-06 23:02:09,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:09,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:09,265 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:09,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:09,794 INFO L322 Elim1Store]: treesize reduction 210, result has 38.1 percent of original size [2023-11-06 23:02:09,795 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 550 treesize of output 632 [2023-11-06 23:02:09,901 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 25 treesize of output 19 [2023-11-06 23:02:10,043 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,050 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,061 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,069 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,070 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,073 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,074 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,077 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,083 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,084 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,087 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,090 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,092 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 161 [2023-11-06 23:02:10,198 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,214 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,228 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,249 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,281 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,289 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,296 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,324 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,333 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,337 INFO L217 Elim1Store]: Index analysis took 157 ms [2023-11-06 23:02:10,340 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 163 [2023-11-06 23:02:10,567 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,575 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,576 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:10,610 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:10,622 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:10,632 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:10,666 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,677 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,683 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,686 INFO L217 Elim1Store]: Index analysis took 122 ms [2023-11-06 23:02:10,727 INFO L322 Elim1Store]: treesize reduction 49, result has 14.0 percent of original size [2023-11-06 23:02:10,727 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 124 treesize of output 172 [2023-11-06 23:02:10,864 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:10,898 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:10,905 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:10,917 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,917 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,920 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,921 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,922 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 95 [2023-11-06 23:02:11,106 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:11,156 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:11,167 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:11,196 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:11,210 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:11,210 INFO L217 Elim1Store]: Index analysis took 133 ms [2023-11-06 23:02:11,277 INFO L322 Elim1Store]: treesize reduction 72, result has 19.1 percent of original size [2023-11-06 23:02:11,278 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 110 treesize of output 118 [2023-11-06 23:02:12,615 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 40 treesize of output 71 [2023-11-06 23:02:12,675 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 35 treesize of output 61 [2023-11-06 23:02:13,207 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 12 treesize of output 11 [2023-11-06 23:02:13,234 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 23:02:13,270 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1689 treesize of output 1389 [2023-11-06 23:02:16,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:16,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:16,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:16,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:16,814 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:16,825 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:16,827 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 58 [2023-11-06 23:02:17,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:17,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:17,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:17,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:17,233 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:17,244 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:17,245 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 63 [2023-11-06 23:02:20,195 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:20,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:20,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:20,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:20,203 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:20,207 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 47 [2023-11-06 23:02:20,220 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 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-06 23:02:20,228 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 23:02:22,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:22,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:22,586 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:22,615 INFO L322 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2023-11-06 23:02:22,615 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 77 [2023-11-06 23:02:22,630 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 25 treesize of output 19 [2023-11-06 23:02:22,640 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 12 treesize of output 11 [2023-11-06 23:02:22,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:22,705 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 37 [2023-11-06 23:02:22,906 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|))) (and (or (and (not (= |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (not (= |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|))) .cse0) (not (= |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (= |c_ULTIMATE.start_test_fun_~i_ref~0#1.offset| 0) (= |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.offset| 0) (= |c_ULTIMATE.start_test_fun_~j_ref~0#1.offset| 0) (not (= |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (let ((.cse31 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (let ((.cse3 (select .cse31 0)) (.cse94 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|))) (let ((.cse89 (<= 0 (select .cse94 0))) (.cse7 (<= 0 (+ .cse3 2147483648))) (.cse12 (= |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (.cse29 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|))) (let ((.cse13 (<= 0 (select .cse2 0))) (.cse40 (select .cse29 0)) (.cse15 (<= 0 .cse3)) (.cse70 (store .cse29 0 .cse3)) (.cse96 (not .cse0)) (.cse14 (not .cse12)) (.cse95 (and .cse89 .cse7 .cse12))) (or (and .cse0 (or (and (or (exists ((v_DerPreprocessor_91 (Array Int Int)) (v_prenex_175 (Array Int Int)) (v_prenex_176 (Array Int Int)) (v_prenex_177 (Array Int Int)) (v_DerPreprocessor_90 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int)) (v_DerPreprocessor_67 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_67) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_69) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_176)) (.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_89) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_91) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_90)) (.cse4 (select v_DerPreprocessor_90 0)) (.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_175) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_177) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_176))) (and (= (select .cse1 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) v_DerPreprocessor_67) (= .cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse3 .cse4) (= (select .cse5 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) v_prenex_175) (= v_DerPreprocessor_89 (select .cse6 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (= .cse2 (select .cse6 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= (select v_prenex_176 0) .cse4) (= v_DerPreprocessor_90 (store v_prenex_176 0 .cse4)) (<= 0 .cse4) (= .cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|))))) (and (exists ((|ULTIMATE.start_test_fun_~c~0#1.base| Int)) (and (not (= |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (<= 0 (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) 0)))) .cse7) (exists ((v_DerPreprocessor_95 (Array Int Int)) (v_DerPreprocessor_93 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_67 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_67) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_69) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_56)) (.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_55) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_56)) (.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_93) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_95) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_56)) (.cse11 (select v_DerPreprocessor_56 0))) (and (= .cse2 (select .cse8 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= (select .cse9 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) v_DerPreprocessor_67) (= .cse2 (select .cse9 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse2 (select .cse10 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse11 .cse3) (= v_DerPreprocessor_55 (select .cse10 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (= (select .cse8 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) v_DerPreprocessor_93) (<= 0 .cse11))))) .cse12) (and .cse7 .cse13 .cse14) (and .cse15 .cse14) (and .cse12 (or (exists ((v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_77 (Array Int Int)) (v_DerPreprocessor_67 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_79 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse16 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_77) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_79) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_56)) (.cse17 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_67) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_69) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_56)) (.cse18 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_55) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_56)) (.cse19 (select v_DerPreprocessor_56 0))) (and (= .cse2 (select .cse16 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= v_DerPreprocessor_77 (select .cse16 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (= (select .cse17 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) v_DerPreprocessor_67) (= .cse2 (select .cse17 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse2 (select .cse18 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse19 .cse3) (= v_DerPreprocessor_55 (select .cse18 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (<= 0 .cse19)))) (exists ((v_prenex_175 (Array Int Int)) (v_prenex_176 (Array Int Int)) (v_prenex_177 (Array Int Int)) (v_DerPreprocessor_77 (Array Int Int)) (v_DerPreprocessor_67 (Array Int Int)) (v_DerPreprocessor_79 (Array Int Int)) (v_DerPreprocessor_69 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_67) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_69) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_176)) (.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_77) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_79) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_176)) (.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_175) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_177) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_176)) (.cse23 (select v_prenex_176 0))) (and (= (select .cse20 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) v_DerPreprocessor_67) (= (select .cse21 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse2) (= .cse2 (select .cse20 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= (select .cse21 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) v_DerPreprocessor_77) (= (select .cse22 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) v_prenex_175) (<= 0 .cse23) (= .cse2 (select .cse22 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse23 .cse3)))))) (and .cse14 (or (exists ((v_prenex_349 (Array Int Int)) (v_DerPreprocessor_85 (Array Int Int)) (v_DerPreprocessor_86 (Array Int Int)) (v_DerPreprocessor_87 (Array Int Int)) (v_prenex_187 (Array Int Int)) (v_prenex_189 (Array Int Int)) (v_prenex_348 (Array Int Int))) (let ((.cse32 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_85))) (let ((.cse24 (select .cse32 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (let ((.cse30 (select .cse24 0))) (let ((.cse25 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_348) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_349) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_85)) (.cse28 (select v_DerPreprocessor_85 0)) (.cse26 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_189) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_187) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_85)) (.cse27 (store v_DerPreprocessor_85 0 .cse30))) (and (= .cse24 (select .cse25 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (= (select .cse26 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) .cse27) (= (select .cse25 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse2) (<= 0 .cse28) (= (store v_DerPreprocessor_85 0 .cse28) .cse29) (= .cse2 (select .cse26 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse24 .cse27) (<= 0 (+ .cse30 2147483648)) (= .cse31 .cse24) (= (select .cse32 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse2))))))) (exists ((v_DerPreprocessor_85 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_prenex_180 (Array Int Int)) (v_DerPreprocessor_86 (Array Int Int)) (v_DerPreprocessor_64 (Array Int Int)) (v_DerPreprocessor_87 (Array Int Int)) (v_DerPreprocessor_65 (Array Int Int)) (v_prenex_178 (Array Int Int))) (let ((.cse38 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_85))) (let ((.cse36 (select .cse38 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (let ((.cse34 (select v_DerPreprocessor_85 0)) (.cse33 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_64) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_65) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_63)) (.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_180) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_178) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_85)) (.cse37 (select .cse36 0))) (and (= .cse2 (select .cse33 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= (select v_DerPreprocessor_63 0) .cse34) (= .cse2 (select .cse35 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (<= 0 .cse34) (= (store v_DerPreprocessor_85 0 .cse34) .cse29) (= .cse36 (store v_DerPreprocessor_63 0 .cse37)) (= .cse36 (select .cse33 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (= (select .cse35 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) (store v_DerPreprocessor_85 0 .cse37)) (<= 0 (+ .cse37 2147483648)) (= .cse31 .cse36) (= (select .cse38 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse2)))))) (exists ((v_prenex_339 (Array Int Int)) (v_DerPreprocessor_81 (Array Int Int)) (v_DerPreprocessor_82 (Array Int Int)) (v_prenex_196 (Array Int Int)) (v_prenex_340 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int)) (v_prenex_198 (Array Int Int))) (let ((.cse42 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_81)) (.cse44 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_198) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_196) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_81))) (let ((.cse47 (select .cse44 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (.cse43 (select .cse42 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (let ((.cse39 (select v_DerPreprocessor_81 0)) (.cse41 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_339) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_340) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_81)) (.cse45 (select .cse43 0)) (.cse46 (select .cse47 0))) (and (<= 0 .cse39) (= .cse40 .cse39) (= (select .cse41 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse2) (= .cse2 (select .cse42 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse31 .cse43) (= .cse43 (select .cse41 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (= .cse2 (select .cse44 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= (store v_DerPreprocessor_81 0 .cse45) .cse43) (<= 0 (+ 2147483648 .cse46)) (= (store .cse47 0 .cse40) .cse29) (= .cse45 .cse46)))))) (exists ((v_prenex_349 (Array Int Int)) (v_DerPreprocessor_86 (Array Int Int)) (v_DerPreprocessor_87 (Array Int Int)) (v_prenex_184 (Array Int Int)) (v_prenex_185 (Array Int Int)) (v_prenex_186 (Array Int Int)) (v_prenex_348 (Array Int Int))) (let ((.cse52 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_185))) (let ((.cse49 (select .cse52 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (let ((.cse50 (select .cse49 0))) (let ((.cse48 (select v_prenex_185 0)) (.cse51 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_348) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_349) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_185)) (.cse53 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_186) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_184) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_185)) (.cse54 (store v_prenex_185 0 .cse50))) (and (<= 0 .cse48) (= (store v_prenex_185 0 .cse48) .cse29) (= .cse31 .cse49) (<= 0 (+ .cse50 2147483648)) (= (select .cse51 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) .cse49) (= (select .cse52 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse2) (= (select .cse51 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse2) (= (select .cse53 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) .cse54) (= .cse2 (select .cse53 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse54 .cse49))))))) (exists ((v_prenex_193 (Array Int Int)) (v_DerPreprocessor_81 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int)) (v_prenex_200 (Array Int Int)) (v_prenex_201 (Array Int Int)) (v_prenex_202 (Array Int Int))) (let ((.cse60 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_81))) (let ((.cse57 (select .cse60 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (let ((.cse59 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_201) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_202) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_200)) (.cse56 (select .cse57 0)) (.cse58 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_195) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_193) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_81)) (.cse55 (select v_DerPreprocessor_81 0))) (and (<= 0 .cse55) (= .cse55 (select v_prenex_200 0)) (= (store v_prenex_200 0 .cse56) .cse57) (= (select .cse58 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse2) (= (select .cse59 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) .cse57) (= .cse2 (select .cse60 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse31 .cse57) (<= 0 (+ .cse56 2147483648)) (= .cse2 (select .cse59 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= (store v_DerPreprocessor_81 0 .cse56) (select .cse58 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (= (store v_DerPreprocessor_81 0 .cse55) .cse29)))))) (exists ((v_prenex_190 (Array Int Int)) (v_prenex_339 (Array Int Int)) (v_prenex_191 (Array Int Int)) (v_prenex_192 (Array Int Int)) (v_DerPreprocessor_82 (Array Int Int)) (v_prenex_340 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (let ((.cse64 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_191))) (let ((.cse66 (select .cse64 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (let ((.cse62 (select .cse66 0))) (let ((.cse61 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_192) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_190) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_191)) (.cse63 (select v_prenex_191 0)) (.cse65 (store v_prenex_191 0 .cse62)) (.cse67 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_339) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_340) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_191))) (and (= .cse2 (select .cse61 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (<= 0 (+ .cse62 2147483648)) (= (store v_prenex_191 0 .cse63) .cse29) (= (select .cse64 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse2) (= .cse65 (select .cse61 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (<= 0 .cse63) (= .cse31 .cse66) (= .cse2 (select .cse67 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse65 .cse66) (= (select .cse67 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) .cse66))))))) (and (or (exists ((|ULTIMATE.start_test_fun_~c~0#1.base| Int)) (let ((.cse68 (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|))) (and (= .cse31 (store .cse68 0 .cse3)) (not (= |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (exists ((v_prenex_187 (Array Int Int)) (v_prenex_188 (Array Int Int)) (v_prenex_189 (Array Int Int))) (let ((.cse69 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_188) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_189) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_187) |ULTIMATE.start_test_fun_~c~0#1.base| .cse68))) (and (= .cse2 (select .cse69 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse70 (select .cse69 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (= (select .cse69 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) .cse29)))) (<= 0 (select .cse68 0)) (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int))) (let ((.cse71 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_60) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_61) |ULTIMATE.start_test_fun_~c~0#1.base| .cse68))) (and (= .cse2 (select .cse71 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= (select .cse71 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) .cse29) (= .cse31 (select .cse71 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|))))) (not (= |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))))) (exists ((|ULTIMATE.start_test_fun_~c~0#1.base| Int)) (let ((.cse75 (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse73 (select .cse75 0))) (and (exists ((v_arrayElimArr_22 (Array Int Int)) (v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int))) (let ((.cse72 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_60) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_61) |ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_22))) (and (= (select .cse72 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) .cse29) (= .cse2 (select .cse72 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse73 (select v_arrayElimArr_22 0)) (= (select .cse72 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) .cse31) (= .cse31 (store v_arrayElimArr_22 0 .cse3))))) (not (= |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (exists ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int))) (let ((.cse74 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_71) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_72) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_73) |ULTIMATE.start_test_fun_~c~0#1.base| .cse75))) (and (= (select .cse74 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) .cse29) (= (select .cse74 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) .cse70) (= .cse2 (select .cse74 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|))))) (<= 0 .cse73) (not (= |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))))))) .cse7) (exists ((v_DerPreprocessor_81 (Array Int Int)) (v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int)) (v_prenex_199 (Array Int Int)) (v_prenex_335 (Array Int Int)) (v_prenex_336 (Array Int Int)) (v_prenex_204 (Array Int Int)) (v_prenex_337 (Array Int Int))) (let ((.cse82 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_81))) (let ((.cse76 (select .cse82 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (.cse81 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_204) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_199) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_81))) (let ((.cse79 (select .cse81 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (.cse80 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_prenex_336) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_337) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_335)) (.cse77 (select .cse76 0)) (.cse78 (select v_DerPreprocessor_81 0))) (and (= .cse76 (store v_prenex_335 0 .cse77)) (<= 0 .cse78) (= (store .cse79 0 .cse40) .cse29) (= .cse40 .cse78) (= .cse77 (select .cse79 0)) (= .cse2 (select .cse80 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= (select .cse80 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) .cse76) (= .cse2 (select .cse81 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse2 (select .cse82 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse31 .cse76) (<= 0 (+ .cse77 2147483648)) (= (select v_prenex_335 0) .cse78)))))) (exists ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_85 (Array Int Int)) (v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_86 (Array Int Int)) (v_DerPreprocessor_64 (Array Int Int)) (v_DerPreprocessor_87 (Array Int Int)) (v_DerPreprocessor_65 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int))) (let ((.cse88 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_86) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_87) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_85))) (let ((.cse86 (select .cse88 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (let ((.cse85 (select v_DerPreprocessor_85 0)) (.cse83 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_64) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_65) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_63)) (.cse84 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_72) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_73) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_85)) (.cse87 (select .cse86 0))) (and (= .cse2 (select .cse83 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= (select .cse84 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse2) (= (select v_DerPreprocessor_63 0) .cse85) (<= 0 .cse85) (= (store v_DerPreprocessor_85 0 .cse85) .cse29) (= .cse86 (store v_DerPreprocessor_63 0 .cse87)) (= .cse86 (select .cse83 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (<= 0 (+ .cse87 2147483648)) (= (select .cse84 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) (store v_DerPreprocessor_85 0 .cse87)) (= .cse31 .cse86) (= (select .cse88 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse2)))))))))) (and (or (and .cse89 .cse14 (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse93 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| .cse94))) (let ((.cse92 (select .cse93 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (let ((.cse90 (select .cse93 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (.cse91 (select .cse92 0))) (and (= (store .cse90 0 .cse91) .cse92) (= .cse3 .cse91) (= .cse90 .cse29) (<= 0 (+ .cse91 2147483648)) (= .cse2 (select .cse93 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)))))))) .cse95) .cse96) (and (or (and (let ((.cse98 (exists ((v_prenex_25 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse112 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_26) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_28) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_25) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| .cse31))) (and (= (select .cse112 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse2) (= (select .cse112 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) v_prenex_26) (= .cse94 (select .cse112 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)))))) (.cse101 (exists ((v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int))) (let ((.cse111 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_prenex_18) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_prenex_20) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_prenex_17) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| .cse31))) (and (= (select .cse111 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) v_prenex_18) (= (select .cse111 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse2) (= .cse94 (select .cse111 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|))))))) (or (and .cse15 (exists ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse97 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| .cse31))) (and (= .cse2 (select .cse97 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse94 (select .cse97 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= (select .cse97 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) v_DerPreprocessor_35)))) .cse98) (and .cse7 .cse98 (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse99 (select v_DerPreprocessor_31 0)) (.cse100 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_31))) (and (= .cse3 .cse99) (= (store .cse31 0 .cse99) v_DerPreprocessor_31) (= .cse94 (select .cse100 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= v_DerPreprocessor_30 (select .cse100 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (<= 0 .cse99) (= .cse2 (select .cse100 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)))))) (and .cse101 (exists ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse103 (select v_DerPreprocessor_36 0)) (.cse102 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_36))) (and (= .cse94 (select .cse102 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= .cse2 (select .cse102 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse103 .cse3) (<= 0 .cse103) (= v_DerPreprocessor_35 (select .cse102 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)))))) (and .cse101 (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse104 (select v_DerPreprocessor_31 0)) (.cse105 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_31))) (and (= .cse3 .cse104) (= .cse94 (select .cse105 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= v_DerPreprocessor_30 (select .cse105 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (<= 0 .cse104) (= .cse2 (select .cse105 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)))))) (and .cse7 (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (|ULTIMATE.start_test_fun_~c~0#1.base| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse110 (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse107 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_DerPreprocessor_42) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_test_fun_~c~0#1.base| .cse110))) (let ((.cse109 (select .cse110 0)) (.cse106 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_15) |ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_12)) (.cse108 (select .cse107 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (and (= .cse2 (select .cse106 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= v_DerPreprocessor_40 (select .cse107 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (= .cse31 (store v_arrayElimArr_12 0 .cse3)) (= (select .cse107 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse2) (not (= |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (select .cse106 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) v_DerPreprocessor_12) (= .cse94 (select .cse107 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= .cse108 (select .cse106 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (= .cse109 (select v_arrayElimArr_12 0)) (<= 0 .cse109) (= .cse94 (select .cse106 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= (select .cse108 0) .cse3))))))))) .cse12) (and (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse113 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| .cse2))) (let ((.cse114 (select .cse113 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|))) (and (= .cse94 (select .cse113 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= .cse114 .cse29) (= (store .cse114 0 .cse3) (select .cse113 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)))))) .cse7 .cse14) (and .cse7 .cse12)) .cse13) (and (let ((.cse115 (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse123 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| .cse70))) (and (= (select .cse123 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|) .cse94) (= (select .cse123 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) .cse29) (= .cse2 (select .cse123 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|))))))) (or (and .cse115 .cse15 (exists ((v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse116 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| .cse31))) (and (= (select .cse116 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) .cse29) (= (select .cse116 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|) .cse94) (= .cse2 (select .cse116 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)))))) (and (<= 0 .cse40) .cse7) (and .cse7 (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int)) (|ULTIMATE.start_test_fun_~c~0#1.base| Int) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse118 (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) 0))) (let ((.cse117 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_DerPreprocessor_24) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_25) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse29 0 .cse118)))) (and (not (= |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= .cse2 (select .cse117 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= .cse94 (select .cse117 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= (select .cse117 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) .cse29) (= .cse31 (select .cse117 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (<= 0 .cse118) (not (= |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))))))) (and (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (|ULTIMATE.start_test_fun_~c~0#1.base| Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse121 (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse120 (select .cse121 0))) (let ((.cse119 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_DerPreprocessor_24) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_25) |ULTIMATE.start_test_fun_~c~0#1.base| (store .cse29 0 .cse120)))) (and (not (= |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= .cse2 (select .cse119 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= (store .cse31 0 .cse120) .cse121) (= .cse94 (select .cse119 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= (select .cse119 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) .cse29) (= .cse31 (select .cse119 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (<= 0 .cse120) (not (= |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))))))) .cse7) (and .cse115 .cse15 (exists ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_50 (Array Int Int))) (let ((.cse122 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| .cse31))) (and (= (select .cse122 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) .cse29) (= .cse94 (select .cse122 |c_ULTIMATE.start_test_fun_~k_ref~0#1.base|)) (= (select .cse122 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) .cse2))))))) .cse14)) .cse96) (and .cse0 (or (and .cse89 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse124 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| .cse94))) (let ((.cse126 (select .cse124 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|))) (let ((.cse125 (select .cse126 0))) (and (= (select .cse124 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) .cse29) (<= 0 (+ .cse125 2147483648)) (= (store .cse29 0 .cse125) .cse126) (= .cse3 .cse125)))))) .cse14) .cse95))))))))) is different from true [2023-11-06 23:02:36,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:36,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:36,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:36,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:38,374 INFO L322 Elim1Store]: treesize reduction 423, result has 32.4 percent of original size [2023-11-06 23:02:38,376 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 4 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 49 case distinctions, treesize of input 4232 treesize of output 3819 [2023-11-06 23:02:38,843 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1470 treesize of output 1474 [2023-11-06 23:02:39,141 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1455 treesize of output 1462 [2023-11-06 23:02:39,442 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 1445 treesize of output 1446 [2023-11-06 23:02:39,641 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1438 treesize of output 1442 [2023-11-06 23:02:40,054 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 1423 treesize of output 1417 [2023-11-06 23:02:40,251 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 1417 treesize of output 1418 [2023-11-06 23:02:40,452 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 1410 treesize of output 1411 [2023-11-06 23:02:40,722 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1403 treesize of output 1407 [2023-11-06 23:02:41,110 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1388 treesize of output 1395 [2023-11-06 23:02:41,473 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 1378 treesize of output 1379 [2023-11-06 23:02:41,797 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1371 treesize of output 1378 [2023-11-06 23:02:42,165 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 1361 treesize of output 1362 [2023-11-06 23:02:42,495 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 1354 treesize of output 1353 [2023-11-06 23:02:42,779 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 1345 treesize of output 1344 [2023-11-06 23:02:43,684 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 13 treesize of output 9 [2023-11-06 23:02:43,716 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 13 treesize of output 9 [2023-11-06 23:02:43,803 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 13 treesize of output 9 [2023-11-06 23:02:43,864 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 13 treesize of output 9 [2023-11-06 23:02:44,385 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 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-06 23:02:45,041 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 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-06 23:02:45,076 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 7 treesize of output 5 [2023-11-06 23:02:45,195 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 13 treesize of output 9 [2023-11-06 23:02:45,258 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 13 treesize of output 9 [2023-11-06 23:02:45,793 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 7 treesize of output 5 [2023-11-06 23:02:45,873 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 7 treesize of output 5 [2023-11-06 23:02:45,952 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 7 treesize of output 5 [2023-11-06 23:02:46,037 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 7 treesize of output 5 [2023-11-06 23:02:46,141 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 7 treesize of output 5 [2023-11-06 23:02:46,203 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 7 treesize of output 5 [2023-11-06 23:02:46,289 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 7 treesize of output 5 [2023-11-06 23:02:46,355 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 7 treesize of output 5 [2023-11-06 23:02:46,483 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 7 treesize of output 5 [2023-11-06 23:02:46,563 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 7 treesize of output 5 [2023-11-06 23:02:46,633 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 7 treesize of output 5 [2023-11-06 23:02:46,989 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 7 treesize of output 5 [2023-11-06 23:02:48,915 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 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-06 23:02:49,450 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 7 treesize of output 5 [2023-11-06 23:03:03,391 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 12 treesize of output 1 [2023-11-06 23:03:03,411 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 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-06 23:03:06,228 INFO L322 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2023-11-06 23:03:06,228 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 28 [2023-11-06 23:03:06,563 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 23:03:06,563 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2023-11-06 23:03:07,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:03:07,064 INFO L322 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2023-11-06 23:03:07,065 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 44 [2023-11-06 23:03:07,077 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:03:07,078 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 35 [2023-11-06 23:03:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 4 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-06 23:03:07,742 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:03:08,401 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_204 (Array Int Int)) (v_ArrVal_205 Int)) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_ArrVal_204))) (store .cse1 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| (store (select .cse1 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.offset| (select (select .cse1 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~i_ref~0#1.offset|)))))) (or (< v_ArrVal_205 (select (select .cse0 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~j_ref~0#1.offset|)) (< 0 (+ 2147483650 (select (select (store .cse0 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| (store (select .cse0 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~i_ref~0#1.offset| v_ArrVal_205)) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.offset|)))))) is different from false [2023-11-06 23:03:08,430 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_204 (Array Int Int)) (v_ArrVal_205 Int)) (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~j_ref~0#1.offset| (+ |c_ULTIMATE.start_test_fun_#t~mem14#1| 1))) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_ArrVal_204))) (store .cse1 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| (store (select .cse1 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.offset| (select (select .cse1 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~i_ref~0#1.offset|)))))) (or (< v_ArrVal_205 (select (select .cse0 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~j_ref~0#1.offset|)) (< 0 (+ 2147483650 (select (select (store .cse0 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| (store (select .cse0 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~i_ref~0#1.offset| v_ArrVal_205)) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.offset|)))))) is different from false [2023-11-06 23:03:08,452 WARN L839 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_test_fun_#t~mem14#1| Int)) (or (< (+ 2147483649 |ULTIMATE.start_test_fun_#t~mem14#1|) 0) (forall ((v_ArrVal_204 (Array Int Int)) (v_ArrVal_205 Int)) (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~j_ref~0#1.offset| (+ |ULTIMATE.start_test_fun_#t~mem14#1| 1))) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_ArrVal_204))) (store .cse1 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| (store (select .cse1 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.offset| (select (select .cse1 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~i_ref~0#1.offset|)))))) (or (< v_ArrVal_205 (select (select .cse0 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~j_ref~0#1.offset|)) (< 0 (+ 2147483650 (select (select (store .cse0 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| (store (select .cse0 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~i_ref~0#1.offset| v_ArrVal_205)) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.offset|)))))))) is different from false [2023-11-06 23:03:08,497 WARN L839 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_test_fun_#t~mem14#1| Int) (v_ArrVal_204 (Array Int Int)) (v_ArrVal_201 Int) (v_ArrVal_205 Int) (v_ArrVal_202 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| v_ArrVal_202))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~i_ref~0#1.offset| v_ArrVal_201))) (let ((.cse6 (store .cse3 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| .cse4))) (let ((.cse1 (store (select .cse6 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~j_ref~0#1.offset| (+ |ULTIMATE.start_test_fun_#t~mem14#1| 1)))) (let ((.cse2 (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| .cse1) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_ArrVal_204))) (store (select .cse5 |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.offset| (select (select .cse5 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~i_ref~0#1.offset|))))) (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| .cse4) |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| .cse1) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_ArrVal_204) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| .cse2))) (or (< v_ArrVal_205 (select (select .cse0 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~j_ref~0#1.offset|)) (< 0 (+ 2147483650 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~j_ref~0#1.base| .cse1) |c_ULTIMATE.start_test_fun_~k_ref~0#1.base| v_ArrVal_204) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base| .cse2) |c_ULTIMATE.start_test_fun_~i_ref~0#1.base| (store (select .cse0 |c_ULTIMATE.start_test_fun_~i_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~i_ref~0#1.offset| v_ArrVal_205)) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~tmp_ref~0#1.offset|))) (< (+ 2147483649 |ULTIMATE.start_test_fun_#t~mem14#1|) 0) (< v_ArrVal_201 (select (select .cse3 |c_ULTIMATE.start_test_fun_~j_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~j_ref~0#1.offset|)))))))))) is different from false [2023-11-06 23:03:08,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-06 23:03:08,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167071600] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:03:08,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:03:08,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 19 [2023-11-06 23:03:08,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766168509] [2023-11-06 23:03:08,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:03:08,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-06 23:03:08,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:08,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-06 23:03:08,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=169, Unknown=11, NotChecked=150, Total=380 [2023-11-06 23:03:08,694 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:18,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 23:03:19,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:19,904 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2023-11-06 23:03:19,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:03:19,905 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-06 23:03:19,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:19,905 INFO L225 Difference]: With dead ends: 18 [2023-11-06 23:03:19,905 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 23:03:19,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=20, NotChecked=190, Total=552 [2023-11-06 23:03:19,907 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 39 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 24 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:19,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 23 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 25 Invalid, 11 Unknown, 66 Unchecked, 2.9s Time] [2023-11-06 23:03:19,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 23:03:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 23:03:19,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 23:03:19,909 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2023-11-06 23:03:19,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:19,909 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 23:03:19,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:19,910 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 23:03:19,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 23:03:19,913 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2023-11-06 23:03:19,914 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2023-11-06 23:03:19,914 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2023-11-06 23:03:19,914 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2023-11-06 23:03:19,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfc8f8-f34d-44ff-9801-56ed970164f8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:20,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfc8f8-f34d-44ff-9801-56ed970164f8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:20,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 23:03:20,281 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 562) no Hoare annotation was computed. [2023-11-06 23:03:20,281 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 23:03:20,281 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 563) no Hoare annotation was computed. [2023-11-06 23:03:20,282 INFO L899 garLoopResultBuilder]: For program point L562(line 562) no Hoare annotation was computed. [2023-11-06 23:03:20,282 INFO L899 garLoopResultBuilder]: For program point L562-1(line 562) no Hoare annotation was computed. [2023-11-06 23:03:20,282 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 23:03:20,282 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 567 569) the Hoare annotation is: true [2023-11-06 23:03:20,282 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 23:03:20,283 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 562) no Hoare annotation was computed. [2023-11-06 23:03:20,283 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 563) no Hoare annotation was computed. [2023-11-06 23:03:20,283 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 23:03:20,283 INFO L899 garLoopResultBuilder]: For program point L563(line 563) no Hoare annotation was computed. [2023-11-06 23:03:20,283 INFO L899 garLoopResultBuilder]: For program point L563-1(line 563) no Hoare annotation was computed. [2023-11-06 23:03:20,283 INFO L899 garLoopResultBuilder]: For program point L559-1(line 559) no Hoare annotation was computed. [2023-11-06 23:03:20,284 INFO L899 garLoopResultBuilder]: For program point L559-3(line 559) no Hoare annotation was computed. [2023-11-06 23:03:20,284 INFO L899 garLoopResultBuilder]: For program point L559-4(line 559) no Hoare annotation was computed. [2023-11-06 23:03:20,284 INFO L899 garLoopResultBuilder]: For program point L559-6(lines 559 564) no Hoare annotation was computed. [2023-11-06 23:03:20,284 INFO L895 garLoopResultBuilder]: At program point L559-8(lines 559 564) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_~j_ref~0#1.base| |ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~i_ref~0#1.base| |ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~tmp_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~k_ref~0#1.base| |ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~i_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~j_ref~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~i_ref~0#1.base|) 0) 2147483648)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~k_ref~0#1.base|) |ULTIMATE.start_test_fun_~k_ref~0#1.offset|) 2147483647) (not (= |ULTIMATE.start_test_fun_~k_ref~0#1.base| |ULTIMATE.start_test_fun_~i_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~k_ref~0#1.base| |ULTIMATE.start_test_fun_~j_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~j_ref~0#1.base| |ULTIMATE.start_test_fun_~tmp_ref~0#1.base|)) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~j_ref~0#1.base|) 0) 2147483648))) [2023-11-06 23:03:20,284 INFO L899 garLoopResultBuilder]: For program point L559-9(lines 559 564) no Hoare annotation was computed. [2023-11-06 23:03:20,285 INFO L902 garLoopResultBuilder]: At program point test_fun_returnLabel#1(lines 547 566) the Hoare annotation is: true [2023-11-06 23:03:20,288 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-06 23:03:20,290 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:03:20,305 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~i_ref~0!base] could not be translated [2023-11-06 23:03:20,305 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~i_ref~0!base][0] could not be translated [2023-11-06 23:03:20,306 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~j_ref~0!base] could not be translated [2023-11-06 23:03:20,306 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~j_ref~0!base][0] could not be translated [2023-11-06 23:03:20,307 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~i_ref~0!base] could not be translated [2023-11-06 23:03:20,308 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~i_ref~0!base][0] could not be translated [2023-11-06 23:03:20,308 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~j_ref~0!base] could not be translated [2023-11-06 23:03:20,308 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~j_ref~0!base][0] could not be translated [2023-11-06 23:03:20,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:03:20 BoogieIcfgContainer [2023-11-06 23:03:20,309 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:03:20,310 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:03:20,310 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:03:20,310 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:03:20,311 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:01:52" (3/4) ... [2023-11-06 23:03:20,313 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 23:03:20,322 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-06 23:03:20,323 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 23:03:20,323 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 23:03:20,323 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 23:03:20,385 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfc8f8-f34d-44ff-9801-56ed970164f8/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 23:03:20,386 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfc8f8-f34d-44ff-9801-56ed970164f8/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 23:03:20,386 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:03:20,386 INFO L158 Benchmark]: Toolchain (without parser) took 88606.28ms. Allocated memory was 146.8MB in the beginning and 536.9MB in the end (delta: 390.1MB). Free memory was 101.7MB in the beginning and 241.9MB in the end (delta: -140.2MB). Peak memory consumption was 250.7MB. Max. memory is 16.1GB. [2023-11-06 23:03:20,387 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 102.8MB. Free memory is still 54.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:03:20,387 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.12ms. Allocated memory is still 146.8MB. Free memory was 101.3MB in the beginning and 85.3MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 23:03:20,387 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.86ms. Allocated memory is still 146.8MB. Free memory was 85.3MB in the beginning and 83.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:03:20,388 INFO L158 Benchmark]: Boogie Preprocessor took 47.66ms. Allocated memory is still 146.8MB. Free memory was 83.7MB in the beginning and 82.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:03:20,388 INFO L158 Benchmark]: RCFGBuilder took 419.96ms. Allocated memory is still 146.8MB. Free memory was 82.0MB in the beginning and 114.9MB in the end (delta: -32.9MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2023-11-06 23:03:20,388 INFO L158 Benchmark]: TraceAbstraction took 87505.75ms. Allocated memory was 146.8MB in the beginning and 536.9MB in the end (delta: 390.1MB). Free memory was 114.2MB in the beginning and 246.1MB in the end (delta: -131.8MB). Peak memory consumption was 258.1MB. Max. memory is 16.1GB. [2023-11-06 23:03:20,389 INFO L158 Benchmark]: Witness Printer took 75.83ms. Allocated memory is still 536.9MB. Free memory was 246.1MB in the beginning and 241.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:03:20,391 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 102.8MB. Free memory is still 54.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 473.12ms. Allocated memory is still 146.8MB. Free memory was 101.3MB in the beginning and 85.3MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.86ms. Allocated memory is still 146.8MB. Free memory was 85.3MB in the beginning and 83.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.66ms. Allocated memory is still 146.8MB. Free memory was 83.7MB in the beginning and 82.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 419.96ms. Allocated memory is still 146.8MB. Free memory was 82.0MB in the beginning and 114.9MB in the end (delta: -32.9MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * TraceAbstraction took 87505.75ms. Allocated memory was 146.8MB in the beginning and 536.9MB in the end (delta: 390.1MB). Free memory was 114.2MB in the beginning and 246.1MB in the end (delta: -131.8MB). Peak memory consumption was 258.1MB. Max. memory is 16.1GB. * Witness Printer took 75.83ms. Allocated memory is still 536.9MB. Free memory was 246.1MB in the beginning and 241.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~i_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~i_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~j_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~j_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~i_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~i_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~j_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~j_ref~0!base][0] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 562]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 562]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 563]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 563]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 87.4s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 112 mSDsluCounter, 160 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 66 IncrementalHoareTripleChecker+Unchecked, 107 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 152 IncrementalHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 53 mSDtfsCounter, 152 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 15.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=2, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 8 NumberOfFragments, 61 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1866 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 930 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 74.3s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 90 ConstructedInterpolants, 19 QuantifiedInterpolants, 25706 SizeOfPredicates, 24 NumberOfNonLiveVariables, 176 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 0/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 567]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 559]: Loop Invariant [2023-11-06 23:03:20,400 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~i_ref~0!base] could not be translated [2023-11-06 23:03:20,401 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~i_ref~0!base][0] could not be translated [2023-11-06 23:03:20,401 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~j_ref~0!base] could not be translated [2023-11-06 23:03:20,401 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~j_ref~0!base][0] could not be translated [2023-11-06 23:03:20,402 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~i_ref~0!base] could not be translated [2023-11-06 23:03:20,403 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~i_ref~0!base][0] could not be translated [2023-11-06 23:03:20,403 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~j_ref~0!base] could not be translated [2023-11-06 23:03:20,403 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~j_ref~0!base][0] could not be translated Derived loop invariant: ((((((!((j_ref == i_ref)) && !((i_ref == tmp_ref))) && !((k_ref == tmp_ref))) && (*k_ref <= 2147483647)) && !((k_ref == i_ref))) && !((k_ref == j_ref))) && !((j_ref == tmp_ref))) - InvariantResult [Line: 547]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-11-06 23:03:20,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cbfc8f8-f34d-44ff-9801-56ed970164f8/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE