/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 01:55:32,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 01:55:32,897 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 01:55:32,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 01:55:32,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 01:55:32,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 01:55:32,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 01:55:32,927 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 01:55:32,928 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 01:55:32,928 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 01:55:32,928 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 01:55:32,928 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 01:55:32,929 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 01:55:32,929 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 01:55:32,929 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 01:55:32,929 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 01:55:32,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 01:55:32,930 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 01:55:32,930 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 01:55:32,930 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 01:55:32,930 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 01:55:32,931 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 01:55:32,931 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 01:55:32,931 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 01:55:32,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 01:55:32,931 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 01:55:32,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 01:55:32,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 01:55:32,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 01:55:32,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 01:55:32,932 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 01:55:32,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 01:55:32,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 01:55:32,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 01:55:32,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 01:55:32,933 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-08-24 01:55:33,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 01:55:33,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 01:55:33,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 01:55:33,211 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 01:55:33,211 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 01:55:33,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c [2023-08-24 01:55:34,148 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 01:55:34,385 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 01:55:34,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c [2023-08-24 01:55:34,394 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13eb35bed/c943087254ce48ec9915de99f6f09456/FLAG2a97fc2ca [2023-08-24 01:55:34,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13eb35bed/c943087254ce48ec9915de99f6f09456 [2023-08-24 01:55:34,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 01:55:34,412 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 01:55:34,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 01:55:34,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 01:55:34,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 01:55:34,415 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 01:55:34" (1/1) ... [2023-08-24 01:55:34,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ac06b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:55:34, skipping insertion in model container [2023-08-24 01:55:34,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 01:55:34" (1/1) ... [2023-08-24 01:55:34,433 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 01:55:34,577 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c[4293,4306] [2023-08-24 01:55:34,583 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 01:55:34,594 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 01:55:34,629 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c[4293,4306] [2023-08-24 01:55:34,632 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 01:55:34,644 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 01:55:34,644 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 01:55:34,649 INFO L206 MainTranslator]: Completed translation [2023-08-24 01:55:34,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:55:34 WrapperNode [2023-08-24 01:55:34,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 01:55:34,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 01:55:34,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 01:55:34,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 01:55:34,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:55:34" (1/1) ... [2023-08-24 01:55:34,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:55:34" (1/1) ... [2023-08-24 01:55:34,707 INFO L138 Inliner]: procedures = 26, calls = 79, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 332 [2023-08-24 01:55:34,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 01:55:34,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 01:55:34,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 01:55:34,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 01:55:34,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:55:34" (1/1) ... [2023-08-24 01:55:34,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:55:34" (1/1) ... [2023-08-24 01:55:34,728 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:55:34" (1/1) ... [2023-08-24 01:55:34,728 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:55:34" (1/1) ... [2023-08-24 01:55:34,735 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:55:34" (1/1) ... [2023-08-24 01:55:34,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:55:34" (1/1) ... [2023-08-24 01:55:34,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:55:34" (1/1) ... [2023-08-24 01:55:34,741 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:55:34" (1/1) ... [2023-08-24 01:55:34,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 01:55:34,744 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 01:55:34,744 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 01:55:34,744 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 01:55:34,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:55:34" (1/1) ... [2023-08-24 01:55:34,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 01:55:34,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 01:55:34,798 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 01:55:34,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 01:55:34,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 01:55:34,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 01:55:34,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 01:55:34,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 01:55:34,851 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 01:55:34,851 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 01:55:34,852 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 01:55:34,852 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 01:55:34,852 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 01:55:34,852 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 01:55:34,852 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-24 01:55:34,852 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-24 01:55:34,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 01:55:34,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 01:55:34,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 01:55:34,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 01:55:34,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 01:55:34,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 01:55:34,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 01:55:34,855 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 01:55:34,967 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 01:55:34,968 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 01:55:35,353 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 01:55:35,453 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 01:55:35,453 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-24 01:55:35,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 01:55:35 BoogieIcfgContainer [2023-08-24 01:55:35,455 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 01:55:35,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 01:55:35,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 01:55:35,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 01:55:35,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 01:55:34" (1/3) ... [2023-08-24 01:55:35,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14182d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 01:55:35, skipping insertion in model container [2023-08-24 01:55:35,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:55:34" (2/3) ... [2023-08-24 01:55:35,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14182d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 01:55:35, skipping insertion in model container [2023-08-24 01:55:35,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 01:55:35" (3/3) ... [2023-08-24 01:55:35,460 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt.wvr.c [2023-08-24 01:55:35,472 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 01:55:35,472 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 01:55:35,472 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 01:55:35,529 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-24 01:55:35,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 241 transitions, 514 flow [2023-08-24 01:55:35,701 INFO L124 PetriNetUnfolderBase]: 19/237 cut-off events. [2023-08-24 01:55:35,701 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 01:55:35,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 237 events. 19/237 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 121 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 200. Up to 2 conditions per place. [2023-08-24 01:55:35,706 INFO L82 GeneralOperation]: Start removeDead. Operand has 235 places, 241 transitions, 514 flow [2023-08-24 01:55:35,726 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 219 places, 225 transitions, 474 flow [2023-08-24 01:55:35,730 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 01:55:35,742 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 219 places, 225 transitions, 474 flow [2023-08-24 01:55:35,745 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 225 transitions, 474 flow [2023-08-24 01:55:35,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 225 transitions, 474 flow [2023-08-24 01:55:35,778 INFO L124 PetriNetUnfolderBase]: 19/225 cut-off events. [2023-08-24 01:55:35,778 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 01:55:35,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 225 events. 19/225 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 118 event pairs, 0 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 200. Up to 2 conditions per place. [2023-08-24 01:55:35,780 INFO L119 LiptonReduction]: Number of co-enabled transitions 2000 [2023-08-24 01:55:43,065 INFO L134 LiptonReduction]: Checked pairs total: 4193 [2023-08-24 01:55:43,066 INFO L136 LiptonReduction]: Total number of compositions: 219 [2023-08-24 01:55:43,075 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 01:55:43,079 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=false, 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;@2617a535, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 01:55:43,079 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-24 01:55:43,084 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 01:55:43,084 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2023-08-24 01:55:43,084 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 01:55:43,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:55:43,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:55:43,085 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 01:55:43,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:55:43,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1585291686, now seen corresponding path program 1 times [2023-08-24 01:55:43,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:55:43,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567665602] [2023-08-24 01:55:43,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:55:43,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:55:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:55:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:55:43,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:55:43,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567665602] [2023-08-24 01:55:43,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567665602] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 01:55:43,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 01:55:43,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 01:55:43,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381743484] [2023-08-24 01:55:43,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 01:55:43,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 01:55:43,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:55:43,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 01:55:43,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 01:55:43,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 460 [2023-08-24 01:55:43,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 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-08-24 01:55:43,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:55:43,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 460 [2023-08-24 01:55:43,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:55:44,229 INFO L124 PetriNetUnfolderBase]: 4116/5443 cut-off events. [2023-08-24 01:55:44,230 INFO L125 PetriNetUnfolderBase]: For 397/397 co-relation queries the response was YES. [2023-08-24 01:55:44,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11309 conditions, 5443 events. 4116/5443 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 25218 event pairs, 578 based on Foata normal form. 0/4060 useless extension candidates. Maximal degree in co-relation 9951. Up to 2391 conditions per place. [2023-08-24 01:55:44,251 INFO L140 encePairwiseOnDemand]: 454/460 looper letters, 75 selfloop transitions, 6 changer transitions 8/92 dead transitions. [2023-08-24 01:55:44,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 92 transitions, 419 flow [2023-08-24 01:55:44,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 01:55:44,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 01:55:44,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1309 transitions. [2023-08-24 01:55:44,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742753623188406 [2023-08-24 01:55:44,262 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1309 transitions. [2023-08-24 01:55:44,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1309 transitions. [2023-08-24 01:55:44,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:55:44,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1309 transitions. [2023-08-24 01:55:44,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 218.16666666666666) internal successors, (1309), 6 states have internal predecessors, (1309), 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-08-24 01:55:44,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 460.0) internal successors, (3220), 7 states have internal predecessors, (3220), 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-08-24 01:55:44,289 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 460.0) internal successors, (3220), 7 states have internal predecessors, (3220), 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-08-24 01:55:44,290 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 98 flow. Second operand 6 states and 1309 transitions. [2023-08-24 01:55:44,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 92 transitions, 419 flow [2023-08-24 01:55:44,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 92 transitions, 381 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-24 01:55:44,320 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 121 flow [2023-08-24 01:55:44,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=121, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2023-08-24 01:55:44,323 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2023-08-24 01:55:44,323 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 121 flow [2023-08-24 01:55:44,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 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-08-24 01:55:44,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:55:44,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:55:44,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 01:55:44,324 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 01:55:44,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:55:44,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1968561096, now seen corresponding path program 1 times [2023-08-24 01:55:44,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:55:44,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382638108] [2023-08-24 01:55:44,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:55:44,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:55:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:55:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:55:44,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:55:44,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382638108] [2023-08-24 01:55:44,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382638108] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 01:55:44,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 01:55:44,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 01:55:44,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244787194] [2023-08-24 01:55:44,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 01:55:44,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 01:55:44,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:55:44,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 01:55:44,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 01:55:44,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 460 [2023-08-24 01:55:44,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 192.25) internal successors, (769), 4 states have internal predecessors, (769), 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-08-24 01:55:44,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:55:44,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 460 [2023-08-24 01:55:44,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:55:44,848 INFO L124 PetriNetUnfolderBase]: 3465/4770 cut-off events. [2023-08-24 01:55:44,849 INFO L125 PetriNetUnfolderBase]: For 1772/2004 co-relation queries the response was YES. [2023-08-24 01:55:44,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10709 conditions, 4770 events. 3465/4770 cut-off events. For 1772/2004 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 23697 event pairs, 2333 based on Foata normal form. 324/3918 useless extension candidates. Maximal degree in co-relation 6367. Up to 4194 conditions per place. [2023-08-24 01:55:44,877 INFO L140 encePairwiseOnDemand]: 455/460 looper letters, 32 selfloop transitions, 2 changer transitions 21/63 dead transitions. [2023-08-24 01:55:44,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 284 flow [2023-08-24 01:55:44,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 01:55:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 01:55:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 799 transitions. [2023-08-24 01:55:44,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4342391304347826 [2023-08-24 01:55:44,880 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 799 transitions. [2023-08-24 01:55:44,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 799 transitions. [2023-08-24 01:55:44,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:55:44,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 799 transitions. [2023-08-24 01:55:44,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 199.75) internal successors, (799), 4 states have internal predecessors, (799), 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-08-24 01:55:44,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 460.0) internal successors, (2300), 5 states have internal predecessors, (2300), 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-08-24 01:55:44,884 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 460.0) internal successors, (2300), 5 states have internal predecessors, (2300), 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-08-24 01:55:44,885 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 121 flow. Second operand 4 states and 799 transitions. [2023-08-24 01:55:44,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 284 flow [2023-08-24 01:55:44,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 01:55:44,889 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 132 flow [2023-08-24 01:55:44,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2023-08-24 01:55:44,891 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2023-08-24 01:55:44,892 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 132 flow [2023-08-24 01:55:44,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 192.25) internal successors, (769), 4 states have internal predecessors, (769), 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-08-24 01:55:44,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:55:44,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:55:44,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 01:55:44,897 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 01:55:44,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:55:44,898 INFO L85 PathProgramCache]: Analyzing trace with hash 303485013, now seen corresponding path program 1 times [2023-08-24 01:55:44,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:55:44,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900332010] [2023-08-24 01:55:44,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:55:44,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:55:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:55:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 01:55:45,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:55:45,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900332010] [2023-08-24 01:55:45,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900332010] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 01:55:45,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034047672] [2023-08-24 01:55:45,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:55:45,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 01:55:45,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 01:55:45,146 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 01:55:45,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-24 01:55:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:55:45,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-24 01:55:45,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 01:55:45,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 01:55:45,386 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 01:55:45,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 01:55:45,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034047672] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 01:55:45,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 01:55:45,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 13 [2023-08-24 01:55:45,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252196965] [2023-08-24 01:55:45,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 01:55:45,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 01:55:45,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:55:45,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 01:55:45,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-08-24 01:55:45,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 460 [2023-08-24 01:55:45,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 132 flow. Second operand has 6 states, 6 states have (on average 201.66666666666666) internal successors, (1210), 6 states have internal predecessors, (1210), 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-08-24 01:55:45,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:55:45,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 460 [2023-08-24 01:55:45,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:55:46,237 INFO L124 PetriNetUnfolderBase]: 7268/9574 cut-off events. [2023-08-24 01:55:46,238 INFO L125 PetriNetUnfolderBase]: For 2979/2979 co-relation queries the response was YES. [2023-08-24 01:55:46,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23697 conditions, 9574 events. 7268/9574 cut-off events. For 2979/2979 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 48184 event pairs, 157 based on Foata normal form. 126/8020 useless extension candidates. Maximal degree in co-relation 23682. Up to 2518 conditions per place. [2023-08-24 01:55:46,275 INFO L140 encePairwiseOnDemand]: 452/460 looper letters, 104 selfloop transitions, 13 changer transitions 0/120 dead transitions. [2023-08-24 01:55:46,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 120 transitions, 590 flow [2023-08-24 01:55:46,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 01:55:46,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 01:55:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1488 transitions. [2023-08-24 01:55:46,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.462111801242236 [2023-08-24 01:55:46,278 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1488 transitions. [2023-08-24 01:55:46,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1488 transitions. [2023-08-24 01:55:46,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:55:46,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1488 transitions. [2023-08-24 01:55:46,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 212.57142857142858) internal successors, (1488), 7 states have internal predecessors, (1488), 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-08-24 01:55:46,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 460.0) internal successors, (3680), 8 states have internal predecessors, (3680), 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-08-24 01:55:46,286 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 460.0) internal successors, (3680), 8 states have internal predecessors, (3680), 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-08-24 01:55:46,286 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 132 flow. Second operand 7 states and 1488 transitions. [2023-08-24 01:55:46,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 120 transitions, 590 flow [2023-08-24 01:55:46,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 120 transitions, 586 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 01:55:46,291 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 229 flow [2023-08-24 01:55:46,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=229, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2023-08-24 01:55:46,292 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places. [2023-08-24 01:55:46,292 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 229 flow [2023-08-24 01:55:46,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 201.66666666666666) internal successors, (1210), 6 states have internal predecessors, (1210), 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-08-24 01:55:46,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:55:46,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:55:46,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-24 01:55:46,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 01:55:46,497 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 01:55:46,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:55:46,498 INFO L85 PathProgramCache]: Analyzing trace with hash -230930442, now seen corresponding path program 1 times [2023-08-24 01:55:46,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:55:46,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902576225] [2023-08-24 01:55:46,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:55:46,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:55:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:55:47,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:55:47,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:55:47,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902576225] [2023-08-24 01:55:47,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902576225] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 01:55:47,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525924074] [2023-08-24 01:55:47,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:55:47,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 01:55:47,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 01:55:47,121 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 01:55:47,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-24 01:55:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:55:47,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-24 01:55:47,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 01:55:47,307 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-24 01:55:47,379 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 01:55:47,433 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 01:55:47,521 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 01:55:47,553 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 01:55:47,659 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-08-24 01:55:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:55:47,682 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 01:55:48,182 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 01:55:48,182 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 61 [2023-08-24 01:55:48,188 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1267 treesize of output 1235 [2023-08-24 01:55:48,215 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 607 treesize of output 559 [2023-08-24 01:55:48,226 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 559 treesize of output 535 [2023-08-24 01:55:48,239 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 273 treesize of output 261 [2023-08-24 01:55:48,252 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 523 treesize of output 427 [2023-08-24 01:55:48,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:55:48,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525924074] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 01:55:48,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 01:55:48,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 22 [2023-08-24 01:55:48,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211812261] [2023-08-24 01:55:48,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 01:55:48,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-24 01:55:48,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:55:48,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-24 01:55:48,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=424, Unknown=10, NotChecked=0, Total=552 [2023-08-24 01:55:48,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 460 [2023-08-24 01:55:48,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 229 flow. Second operand has 24 states, 24 states have (on average 147.70833333333334) internal successors, (3545), 24 states have internal predecessors, (3545), 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-08-24 01:55:48,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:55:48,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 460 [2023-08-24 01:55:48,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:55:50,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:55:53,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:55:55,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:55:58,780 INFO L124 PetriNetUnfolderBase]: 22771/29961 cut-off events. [2023-08-24 01:55:58,780 INFO L125 PetriNetUnfolderBase]: For 38219/38458 co-relation queries the response was YES. [2023-08-24 01:55:58,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87690 conditions, 29961 events. 22771/29961 cut-off events. For 38219/38458 co-relation queries the response was YES. Maximal size of possible extension queue 1428. Compared 166122 event pairs, 3847 based on Foata normal form. 335/24651 useless extension candidates. Maximal degree in co-relation 46560. Up to 12523 conditions per place. [2023-08-24 01:55:58,995 INFO L140 encePairwiseOnDemand]: 448/460 looper letters, 225 selfloop transitions, 61 changer transitions 26/317 dead transitions. [2023-08-24 01:55:58,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 317 transitions, 1928 flow [2023-08-24 01:55:58,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-24 01:55:58,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-24 01:55:59,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3746 transitions. [2023-08-24 01:55:59,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3393115942028985 [2023-08-24 01:55:59,002 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3746 transitions. [2023-08-24 01:55:59,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3746 transitions. [2023-08-24 01:55:59,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:55:59,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3746 transitions. [2023-08-24 01:55:59,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 156.08333333333334) internal successors, (3746), 24 states have internal predecessors, (3746), 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-08-24 01:55:59,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 460.0) internal successors, (11500), 25 states have internal predecessors, (11500), 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-08-24 01:55:59,018 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 460.0) internal successors, (11500), 25 states have internal predecessors, (11500), 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-08-24 01:55:59,018 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 229 flow. Second operand 24 states and 3746 transitions. [2023-08-24 01:55:59,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 317 transitions, 1928 flow [2023-08-24 01:55:59,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 317 transitions, 1869 flow, removed 27 selfloop flow, removed 1 redundant places. [2023-08-24 01:55:59,077 INFO L231 Difference]: Finished difference. Result has 91 places, 116 transitions, 770 flow [2023-08-24 01:55:59,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=770, PETRI_PLACES=91, PETRI_TRANSITIONS=116} [2023-08-24 01:55:59,077 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 47 predicate places. [2023-08-24 01:55:59,077 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 116 transitions, 770 flow [2023-08-24 01:55:59,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 147.70833333333334) internal successors, (3545), 24 states have internal predecessors, (3545), 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-08-24 01:55:59,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:55:59,079 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:55:59,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-24 01:55:59,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-24 01:55:59,283 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 01:55:59,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:55:59,283 INFO L85 PathProgramCache]: Analyzing trace with hash -990199483, now seen corresponding path program 2 times [2023-08-24 01:55:59,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:55:59,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360722025] [2023-08-24 01:55:59,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:55:59,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:55:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:56:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:56:00,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:56:00,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360722025] [2023-08-24 01:56:00,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360722025] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 01:56:00,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375522709] [2023-08-24 01:56:00,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 01:56:00,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 01:56:00,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 01:56:00,803 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 01:56:00,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-24 01:56:00,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 01:56:00,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 01:56:00,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-24 01:56:00,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 01:56:01,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 01:56:01,127 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-24 01:56:01,164 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-08-24 01:56:01,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 01:56:01,183 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 01:56:01,284 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 01:56:01,284 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 37 [2023-08-24 01:56:01,288 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 11 treesize of output 5 [2023-08-24 01:56:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 01:56:01,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375522709] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 01:56:01,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 01:56:01,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 20 [2023-08-24 01:56:01,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187854081] [2023-08-24 01:56:01,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 01:56:01,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-24 01:56:01,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:56:01,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-24 01:56:01,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=398, Unknown=6, NotChecked=0, Total=462 [2023-08-24 01:56:01,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 460 [2023-08-24 01:56:01,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 116 transitions, 770 flow. Second operand has 22 states, 22 states have (on average 150.6818181818182) internal successors, (3315), 22 states have internal predecessors, (3315), 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-08-24 01:56:01,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:56:01,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 460 [2023-08-24 01:56:01,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:56:06,726 INFO L124 PetriNetUnfolderBase]: 37842/49789 cut-off events. [2023-08-24 01:56:06,726 INFO L125 PetriNetUnfolderBase]: For 99923/100233 co-relation queries the response was YES. [2023-08-24 01:56:06,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161686 conditions, 49789 events. 37842/49789 cut-off events. For 99923/100233 co-relation queries the response was YES. Maximal size of possible extension queue 2352. Compared 293834 event pairs, 4546 based on Foata normal form. 680/45205 useless extension candidates. Maximal degree in co-relation 139920. Up to 18427 conditions per place. [2023-08-24 01:56:07,119 INFO L140 encePairwiseOnDemand]: 450/460 looper letters, 166 selfloop transitions, 84 changer transitions 11/266 dead transitions. [2023-08-24 01:56:07,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 266 transitions, 2035 flow [2023-08-24 01:56:07,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-24 01:56:07,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-24 01:56:07,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2085 transitions. [2023-08-24 01:56:07,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3486622073578595 [2023-08-24 01:56:07,125 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2085 transitions. [2023-08-24 01:56:07,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2085 transitions. [2023-08-24 01:56:07,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:56:07,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2085 transitions. [2023-08-24 01:56:07,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 160.3846153846154) internal successors, (2085), 13 states have internal predecessors, (2085), 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-08-24 01:56:07,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 460.0) internal successors, (6440), 14 states have internal predecessors, (6440), 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-08-24 01:56:07,136 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 460.0) internal successors, (6440), 14 states have internal predecessors, (6440), 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-08-24 01:56:07,136 INFO L175 Difference]: Start difference. First operand has 91 places, 116 transitions, 770 flow. Second operand 13 states and 2085 transitions. [2023-08-24 01:56:07,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 266 transitions, 2035 flow [2023-08-24 01:56:07,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 266 transitions, 1945 flow, removed 44 selfloop flow, removed 2 redundant places. [2023-08-24 01:56:07,329 INFO L231 Difference]: Finished difference. Result has 106 places, 149 transitions, 1253 flow [2023-08-24 01:56:07,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1253, PETRI_PLACES=106, PETRI_TRANSITIONS=149} [2023-08-24 01:56:07,330 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 62 predicate places. [2023-08-24 01:56:07,330 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 149 transitions, 1253 flow [2023-08-24 01:56:07,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 150.6818181818182) internal successors, (3315), 22 states have internal predecessors, (3315), 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-08-24 01:56:07,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:56:07,331 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:56:07,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-24 01:56:07,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 01:56:07,536 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 01:56:07,536 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:56:07,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1828332499, now seen corresponding path program 3 times [2023-08-24 01:56:07,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:56:07,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603225854] [2023-08-24 01:56:07,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:56:07,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:56:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:56:08,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:56:08,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:56:08,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603225854] [2023-08-24 01:56:08,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603225854] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 01:56:08,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909634158] [2023-08-24 01:56:08,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 01:56:08,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 01:56:08,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 01:56:08,845 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 01:56:08,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-24 01:56:09,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 01:56:09,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 01:56:09,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-24 01:56:09,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 01:56:09,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 01:56:09,241 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-24 01:56:09,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 01:56:09,282 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-24 01:56:09,347 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-08-24 01:56:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 01:56:09,357 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 01:56:09,542 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 01:56:09,543 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 157 [2023-08-24 01:56:09,549 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 31 treesize of output 25 [2023-08-24 01:56:09,552 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 32 treesize of output 20 [2023-08-24 01:56:09,699 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 01:56:09,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909634158] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 01:56:09,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 01:56:09,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 23 [2023-08-24 01:56:09,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150458490] [2023-08-24 01:56:09,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 01:56:09,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-24 01:56:09,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:56:09,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-24 01:56:09,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=508, Unknown=10, NotChecked=0, Total=600 [2023-08-24 01:56:09,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 460 [2023-08-24 01:56:09,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 149 transitions, 1253 flow. Second operand has 25 states, 25 states have (on average 149.2) internal successors, (3730), 25 states have internal predecessors, (3730), 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-08-24 01:56:09,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:56:09,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 460 [2023-08-24 01:56:09,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:56:16,817 INFO L124 PetriNetUnfolderBase]: 52735/69301 cut-off events. [2023-08-24 01:56:16,817 INFO L125 PetriNetUnfolderBase]: For 172729/172817 co-relation queries the response was YES. [2023-08-24 01:56:17,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242389 conditions, 69301 events. 52735/69301 cut-off events. For 172729/172817 co-relation queries the response was YES. Maximal size of possible extension queue 3282. Compared 424909 event pairs, 7690 based on Foata normal form. 50/62036 useless extension candidates. Maximal degree in co-relation 218136. Up to 21320 conditions per place. [2023-08-24 01:56:17,313 INFO L140 encePairwiseOnDemand]: 451/460 looper letters, 205 selfloop transitions, 107 changer transitions 16/331 dead transitions. [2023-08-24 01:56:17,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 331 transitions, 2849 flow [2023-08-24 01:56:17,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-24 01:56:17,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-24 01:56:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2383 transitions. [2023-08-24 01:56:17,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3453623188405797 [2023-08-24 01:56:17,318 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2383 transitions. [2023-08-24 01:56:17,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2383 transitions. [2023-08-24 01:56:17,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:56:17,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2383 transitions. [2023-08-24 01:56:17,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 158.86666666666667) internal successors, (2383), 15 states have internal predecessors, (2383), 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-08-24 01:56:17,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 460.0) internal successors, (7360), 16 states have internal predecessors, (7360), 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-08-24 01:56:17,329 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 460.0) internal successors, (7360), 16 states have internal predecessors, (7360), 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-08-24 01:56:17,329 INFO L175 Difference]: Start difference. First operand has 106 places, 149 transitions, 1253 flow. Second operand 15 states and 2383 transitions. [2023-08-24 01:56:17,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 331 transitions, 2849 flow [2023-08-24 01:56:18,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 331 transitions, 2789 flow, removed 21 selfloop flow, removed 4 redundant places. [2023-08-24 01:56:18,517 INFO L231 Difference]: Finished difference. Result has 118 places, 178 transitions, 1766 flow [2023-08-24 01:56:18,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1766, PETRI_PLACES=118, PETRI_TRANSITIONS=178} [2023-08-24 01:56:18,518 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 74 predicate places. [2023-08-24 01:56:18,518 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 178 transitions, 1766 flow [2023-08-24 01:56:18,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 149.2) internal successors, (3730), 25 states have internal predecessors, (3730), 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-08-24 01:56:18,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:56:18,519 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:56:18,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-24 01:56:18,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 01:56:18,724 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 01:56:18,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:56:18,724 INFO L85 PathProgramCache]: Analyzing trace with hash 280698761, now seen corresponding path program 4 times [2023-08-24 01:56:18,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:56:18,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509671946] [2023-08-24 01:56:18,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:56:18,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:56:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:56:20,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:56:20,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:56:20,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509671946] [2023-08-24 01:56:20,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509671946] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 01:56:20,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970861236] [2023-08-24 01:56:20,124 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 01:56:20,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 01:56:20,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 01:56:20,149 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 01:56:20,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-24 01:56:20,316 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 01:56:20,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 01:56:20,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-24 01:56:20,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 01:56:20,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 01:56:20,623 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-24 01:56:20,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 01:56:20,714 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-24 01:56:20,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 01:56:20,761 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-24 01:56:21,049 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2023-08-24 01:56:21,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:56:21,112 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 01:56:21,578 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 01:56:21,579 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 341 treesize of output 321 [2023-08-24 01:56:21,586 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 152 treesize of output 140 [2023-08-24 01:56:21,591 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 72 treesize of output 66 [2023-08-24 01:56:21,595 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 134 treesize of output 110 [2023-08-24 01:56:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:56:21,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970861236] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 01:56:21,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 01:56:21,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 32 [2023-08-24 01:56:21,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132641432] [2023-08-24 01:56:21,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 01:56:21,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-24 01:56:21,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:56:21,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-24 01:56:21,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=957, Unknown=3, NotChecked=0, Total=1122 [2023-08-24 01:56:21,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 460 [2023-08-24 01:56:21,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 178 transitions, 1766 flow. Second operand has 34 states, 34 states have (on average 143.5) internal successors, (4879), 34 states have internal predecessors, (4879), 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-08-24 01:56:21,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:56:21,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 460 [2023-08-24 01:56:21,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:57:00,146 INFO L124 PetriNetUnfolderBase]: 186756/244222 cut-off events. [2023-08-24 01:57:00,147 INFO L125 PetriNetUnfolderBase]: For 836761/836849 co-relation queries the response was YES. [2023-08-24 01:57:01,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 899607 conditions, 244222 events. 186756/244222 cut-off events. For 836761/836849 co-relation queries the response was YES. Maximal size of possible extension queue 10689. Compared 1684721 event pairs, 9214 based on Foata normal form. 1143/219015 useless extension candidates. Maximal degree in co-relation 854452. Up to 43619 conditions per place. [2023-08-24 01:57:02,430 INFO L140 encePairwiseOnDemand]: 445/460 looper letters, 713 selfloop transitions, 572 changer transitions 31/1319 dead transitions. [2023-08-24 01:57:02,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 1319 transitions, 12177 flow [2023-08-24 01:57:02,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-08-24 01:57:02,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2023-08-24 01:57:02,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 7981 transitions. [2023-08-24 01:57:02,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34019607843137256 [2023-08-24 01:57:02,446 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 7981 transitions. [2023-08-24 01:57:02,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 7981 transitions. [2023-08-24 01:57:02,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:57:02,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 7981 transitions. [2023-08-24 01:57:02,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 156.49019607843138) internal successors, (7981), 51 states have internal predecessors, (7981), 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-08-24 01:57:02,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 460.0) internal successors, (23920), 52 states have internal predecessors, (23920), 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-08-24 01:57:02,483 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 460.0) internal successors, (23920), 52 states have internal predecessors, (23920), 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-08-24 01:57:02,483 INFO L175 Difference]: Start difference. First operand has 118 places, 178 transitions, 1766 flow. Second operand 51 states and 7981 transitions. [2023-08-24 01:57:02,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 1319 transitions, 12177 flow [2023-08-24 01:57:06,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 1319 transitions, 11959 flow, removed 86 selfloop flow, removed 7 redundant places. [2023-08-24 01:57:06,796 INFO L231 Difference]: Finished difference. Result has 187 places, 681 transitions, 8898 flow [2023-08-24 01:57:06,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=1687, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=8898, PETRI_PLACES=187, PETRI_TRANSITIONS=681} [2023-08-24 01:57:06,797 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 143 predicate places. [2023-08-24 01:57:06,797 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 681 transitions, 8898 flow [2023-08-24 01:57:06,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 143.5) internal successors, (4879), 34 states have internal predecessors, (4879), 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-08-24 01:57:06,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:57:06,798 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:57:06,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-24 01:57:07,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 01:57:07,003 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 01:57:07,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:57:07,003 INFO L85 PathProgramCache]: Analyzing trace with hash -592974436, now seen corresponding path program 5 times [2023-08-24 01:57:07,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:57:07,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155076816] [2023-08-24 01:57:07,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:57:07,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:57:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:57:08,318 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:57:08,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:57:08,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155076816] [2023-08-24 01:57:08,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155076816] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 01:57:08,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737538492] [2023-08-24 01:57:08,319 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 01:57:08,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 01:57:08,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 01:57:08,330 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 01:57:08,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-24 01:57:08,451 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-24 01:57:08,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 01:57:08,452 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-24 01:57:08,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 01:57:08,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 01:57:08,606 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-24 01:57:08,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 01:57:08,650 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-24 01:57:08,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 01:57:08,690 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-24 01:57:08,726 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-08-24 01:57:08,739 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 01:57:08,739 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 01:57:08,826 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_478 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_479) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0))) is different from false [2023-08-24 01:57:10,848 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_479) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0))) is different from false [2023-08-24 01:57:10,859 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 01:57:10,859 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 341 treesize of output 325 [2023-08-24 01:57:10,865 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 73 treesize of output 67 [2023-08-24 01:57:10,870 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 67 treesize of output 55 [2023-08-24 01:57:10,915 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 74 treesize of output 50 [2023-08-24 01:57:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 01:57:11,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737538492] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 01:57:11,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 01:57:11,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2023-08-24 01:57:11,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142306402] [2023-08-24 01:57:11,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 01:57:11,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-24 01:57:11,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:57:11,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-24 01:57:11,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=429, Unknown=5, NotChecked=86, Total=600 [2023-08-24 01:57:11,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 460 [2023-08-24 01:57:11,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 681 transitions, 8898 flow. Second operand has 25 states, 25 states have (on average 147.6) internal successors, (3690), 25 states have internal predecessors, (3690), 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-08-24 01:57:11,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:57:11,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 460 [2023-08-24 01:57:11,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:57:50,666 INFO L124 PetriNetUnfolderBase]: 203332/266259 cut-off events. [2023-08-24 01:57:50,666 INFO L125 PetriNetUnfolderBase]: For 2177801/2177871 co-relation queries the response was YES. [2023-08-24 01:57:53,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1243977 conditions, 266259 events. 203332/266259 cut-off events. For 2177801/2177871 co-relation queries the response was YES. Maximal size of possible extension queue 11431. Compared 1853635 event pairs, 33489 based on Foata normal form. 68/237627 useless extension candidates. Maximal degree in co-relation 1225087. Up to 122698 conditions per place. [2023-08-24 01:57:54,490 INFO L140 encePairwiseOnDemand]: 439/460 looper letters, 348 selfloop transitions, 509 changer transitions 11/873 dead transitions. [2023-08-24 01:57:54,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 873 transitions, 12356 flow [2023-08-24 01:57:54,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-24 01:57:54,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-24 01:57:54,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2331 transitions. [2023-08-24 01:57:54,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3378260869565217 [2023-08-24 01:57:54,494 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2331 transitions. [2023-08-24 01:57:54,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2331 transitions. [2023-08-24 01:57:54,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:57:54,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2331 transitions. [2023-08-24 01:57:54,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 155.4) internal successors, (2331), 15 states have internal predecessors, (2331), 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-08-24 01:57:54,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 460.0) internal successors, (7360), 16 states have internal predecessors, (7360), 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-08-24 01:57:54,503 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 460.0) internal successors, (7360), 16 states have internal predecessors, (7360), 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-08-24 01:57:54,504 INFO L175 Difference]: Start difference. First operand has 187 places, 681 transitions, 8898 flow. Second operand 15 states and 2331 transitions. [2023-08-24 01:57:54,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 873 transitions, 12356 flow [2023-08-24 01:59:03,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 873 transitions, 11895 flow, removed 216 selfloop flow, removed 6 redundant places. [2023-08-24 01:59:03,276 INFO L231 Difference]: Finished difference. Result has 197 places, 752 transitions, 10816 flow [2023-08-24 01:59:03,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=8501, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=438, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=10816, PETRI_PLACES=197, PETRI_TRANSITIONS=752} [2023-08-24 01:59:03,278 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 153 predicate places. [2023-08-24 01:59:03,279 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 752 transitions, 10816 flow [2023-08-24 01:59:03,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 147.6) internal successors, (3690), 25 states have internal predecessors, (3690), 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-08-24 01:59:03,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:59:03,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:59:03,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-24 01:59:03,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 01:59:03,486 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 01:59:03,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:59:03,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1962642637, now seen corresponding path program 1 times [2023-08-24 01:59:03,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:59:03,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004947103] [2023-08-24 01:59:03,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:59:03,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:59:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:59:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 01:59:03,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:59:03,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004947103] [2023-08-24 01:59:03,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004947103] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 01:59:03,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 01:59:03,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 01:59:03,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569685977] [2023-08-24 01:59:03,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 01:59:03,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 01:59:03,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:59:03,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 01:59:03,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 01:59:03,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 460 [2023-08-24 01:59:03,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 752 transitions, 10816 flow. Second operand has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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-08-24 01:59:03,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:59:03,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 460 [2023-08-24 01:59:03,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:59:46,931 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([921] L99-->L96: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork0_plus_~a#1_5| |v_thread3Thread1of1ForFork0_plus_~b#1_5|))) (and (= v_~total~0_64 |v_thread3Thread1of1ForFork0_plus_#in~a#1_5|) (= (+ v_~q1_front~0_55 1) v_~q1_front~0_54) (= |v_thread3Thread1of1ForFork0_plus_#in~a#1_5| |v_thread3Thread1of1ForFork0_plus_~a#1_5|) (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_~b#1_5| 0) (<= .cse0 2147483647)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_63) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| .cse0) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_13| 256) 0)) (= |v_thread3Thread1of1ForFork0_plus_#in~b#1_5| |v_thread3Thread1of1ForFork0_plus_~b#1_5|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (= (select (select |v_#memory_int_103| v_~q1~0.base_27) (+ v_~q1~0.offset_27 (* 4 v_~q1_front~0_55))) |v_thread3Thread1of1ForFork0_plus_#in~b#1_5|) (not (= (ite (and (< v_~q1_front~0_55 v_~n1~0_24) (<= 0 v_~q1_front~0_55) (< v_~q1_front~0_55 v_~q1_back~0_63)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_27, ~q1_front~0=v_~q1_front~0_55, ~q1_back~0=v_~q1_back~0_63, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_103|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_64} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_27, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_54, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_5|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_5|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_63, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_63, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_103|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_5|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][359], [947#true, 1769#true, Black: 956#(or (< ~q1_back~0 (+ ~q1_front~0 1)) (and (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|)))), Black: 1179#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), 97#L149-2true, 246#(and (<= ~i~0 0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0) (<= (+ ~i~0 1) ~N~0)), Black: 934#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (< 1 ~q1_front~0)) (<= 0 ~total~0) (or (<= ~n1~0 2) (<= ~q1_front~0 1)) (< 0 ~C~0) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0)), Black: 938#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (or (<= ~q1_back~0 2) (<= ~q1_front~0 1)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), Black: 740#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (< 0 ~C~0) (= ~q1_back~0 ~q1_front~0)), Black: 762#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 940#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|)), 12#L96true, Black: 678#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))) (or (< ~q1_front~0 0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0)) (forall ((v_ArrVal_191 (Array Int Int)) (~q1_front~0 Int) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1) (< 0 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), 711#true, Black: 690#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 686#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0))), Black: 692#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_194 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))), Black: 651#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 688#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_194 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))), Black: 602#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 682#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0))), Black: 450#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 684#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((v_ArrVal_191 (Array Int Int)) (~q1_front~0 Int) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1) (< 0 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 432#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)), Black: 696#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 446#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 261#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1484#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1444#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (and (<= ~q1_front~0 0) (not (= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1478#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1446#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (and (<= ~q1_front~0 0) (not (= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), 448#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 1456#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1432#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0))), Black: 1472#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1436#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (and (or (not (= ~q1_front~0 0)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)))) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (<= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (= ~total~0 0) (<= ~n1~0 ~q1_front~0)) (<= ~n1~0 2)), Black: 1468#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1430#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~n1~0 1)) (<= ~n1~0 2)), Black: 1460#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|)))) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1474#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0))), Black: 1365#(or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 1452#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1192#(and (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= ~q1_front~0 0)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (<= ~q1_front~0 0))))), Black: 1488#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1476#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1194#(<= 1 ~total~0), 457#true, Black: 1765#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 1758#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~q1~0.offset 0) (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_479) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 1470#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (< ~n1~0 1) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1326#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1464#(and (<= 1 ~total~0) (or (< ~n1~0 1) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1492#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (< ~n1~0 1) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1448#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (and (or (not (= ~q1_front~0 0)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)))) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (<= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (= ~total~0 0) (<= ~n1~0 ~q1_front~0)) (<= ~n1~0 2) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1458#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1450#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 244#(and (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), 1318#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 242#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 64#thread4EXITtrue, 1520#true]) [2023-08-24 01:59:46,933 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-24 01:59:46,933 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 01:59:46,933 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 01:59:46,933 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 01:59:47,469 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([935] L117-->L114: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= v_~total~0_68 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (<= 0 (+ |v_thread4Thread1of1ForFork2_plus_#res#1_5| 2147483648)) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (< v_~q2_front~0_59 v_~q2_back~0_57) (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_67) (<= |v_thread4Thread1of1ForFork2_plus_#res#1_5| 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|) (= (select (select |v_#memory_int_107| v_~q2~0.base_37) (+ v_~q2~0.offset_37 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_37, #memory_int=|v_#memory_int_107|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_37, ~q2_back~0=v_~q2_back~0_57, ~total~0=v_~total~0_68, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_37, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_#t~ret13#1=|v_thread4Thread1of1ForFork2_#t~ret13#1_5|, thread4Thread1of1ForFork2_#t~mem12#1=|v_thread4Thread1of1ForFork2_#t~mem12#1_5|, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, ~total~0=v_~total~0_67, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_107|, thread4Thread1of1ForFork2_#t~post14#1=|v_thread4Thread1of1ForFork2_#t~post14#1_5|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_37, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_57} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_#t~post14#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_#t~ret13#1, thread4Thread1of1ForFork2_#t~mem12#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, ~total~0][350], [139#L99true, 189#L114true, 947#true, 1769#true, Black: 956#(or (< ~q1_back~0 (+ ~q1_front~0 1)) (and (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|)))), Black: 1179#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), 1185#true, 97#L149-2true, Black: 934#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (< 1 ~q1_front~0)) (<= 0 ~total~0) (or (<= ~n1~0 2) (<= ~q1_front~0 1)) (< 0 ~C~0) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0)), Black: 938#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (or (<= ~q1_back~0 2) (<= ~q1_front~0 1)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), Black: 740#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (< 0 ~C~0) (= ~q1_back~0 ~q1_front~0)), Black: 762#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 940#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 678#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))) (or (< ~q1_front~0 0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0)) (forall ((v_ArrVal_191 (Array Int Int)) (~q1_front~0 Int) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1) (< 0 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 690#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|))), 711#true, Black: 686#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0))), Black: 692#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_194 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))), Black: 651#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 688#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_194 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))), Black: 602#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 682#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0))), Black: 450#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 684#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((v_ArrVal_191 (Array Int Int)) (~q1_front~0 Int) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1) (< 0 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 696#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 432#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)), Black: 448#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 261#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1484#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1444#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (and (<= ~q1_front~0 0) (not (= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1478#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1446#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (and (<= ~q1_front~0 0) (not (= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1456#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1432#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0))), Black: 1472#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1436#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (and (or (not (= ~q1_front~0 0)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)))) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (<= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (= ~total~0 0) (<= ~n1~0 ~q1_front~0)) (<= ~n1~0 2)), Black: 1468#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), 446#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 1430#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~n1~0 1)) (<= ~n1~0 2)), Black: 1460#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|)))) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1474#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0))), Black: 1365#(or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 1452#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1192#(and (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= ~q1_front~0 0)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (<= ~q1_front~0 0))))), Black: 1488#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1476#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1194#(<= 1 ~total~0), Black: 1765#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), 457#true, Black: 1758#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~q1~0.offset 0) (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_479) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 1470#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (< ~n1~0 1) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1326#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1464#(and (<= 1 ~total~0) (or (< ~n1~0 1) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1492#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (< ~n1~0 1) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1448#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (and (or (not (= ~q1_front~0 0)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)))) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (<= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (= ~total~0 0) (<= ~n1~0 ~q1_front~0)) (<= ~n1~0 2) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1318#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 1458#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1450#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 244#(and (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 242#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 246#(and (<= ~i~0 0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0) (<= (+ ~i~0 1) ~N~0)), 1520#true]) [2023-08-24 01:59:47,469 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-24 01:59:47,469 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 01:59:47,469 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-24 01:59:47,470 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 01:59:47,470 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([935] L117-->L114: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= v_~total~0_68 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (<= 0 (+ |v_thread4Thread1of1ForFork2_plus_#res#1_5| 2147483648)) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (< v_~q2_front~0_59 v_~q2_back~0_57) (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_67) (<= |v_thread4Thread1of1ForFork2_plus_#res#1_5| 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|) (= (select (select |v_#memory_int_107| v_~q2~0.base_37) (+ v_~q2~0.offset_37 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_37, #memory_int=|v_#memory_int_107|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_37, ~q2_back~0=v_~q2_back~0_57, ~total~0=v_~total~0_68, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_37, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_#t~ret13#1=|v_thread4Thread1of1ForFork2_#t~ret13#1_5|, thread4Thread1of1ForFork2_#t~mem12#1=|v_thread4Thread1of1ForFork2_#t~mem12#1_5|, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, ~total~0=v_~total~0_67, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_107|, thread4Thread1of1ForFork2_#t~post14#1=|v_thread4Thread1of1ForFork2_#t~post14#1_5|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_37, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_57} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_#t~post14#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_#t~ret13#1, thread4Thread1of1ForFork2_#t~mem12#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, ~total~0][350], [139#L99true, 189#L114true, 947#true, 1769#true, Black: 956#(or (< ~q1_back~0 (+ ~q1_front~0 1)) (and (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|)))), Black: 1179#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), 1185#true, Black: 934#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (< 1 ~q1_front~0)) (<= 0 ~total~0) (or (<= ~n1~0 2) (<= ~q1_front~0 1)) (< 0 ~C~0) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0)), Black: 938#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (or (<= ~q1_back~0 2) (<= ~q1_front~0 1)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), Black: 740#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (< 0 ~C~0) (= ~q1_back~0 ~q1_front~0)), Black: 762#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 940#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 678#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))) (or (< ~q1_front~0 0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0)) (forall ((v_ArrVal_191 (Array Int Int)) (~q1_front~0 Int) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1) (< 0 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 690#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|))), 711#true, Black: 686#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0))), Black: 692#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_194 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))), Black: 651#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 688#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_194 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))), 111#L150-1true, Black: 602#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 682#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0))), Black: 450#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 684#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((v_ArrVal_191 (Array Int Int)) (~q1_front~0 Int) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1) (< 0 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 696#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 432#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)), Black: 448#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 261#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1484#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1444#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (and (<= ~q1_front~0 0) (not (= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1478#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1446#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (and (<= ~q1_front~0 0) (not (= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1456#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1432#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0))), Black: 1472#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1436#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (and (or (not (= ~q1_front~0 0)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)))) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (<= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (= ~total~0 0) (<= ~n1~0 ~q1_front~0)) (<= ~n1~0 2)), Black: 1468#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), 446#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 1430#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~n1~0 1)) (<= ~n1~0 2)), Black: 1460#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|)))) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1474#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0))), Black: 1365#(or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 1452#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1192#(and (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= ~q1_front~0 0)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (<= ~q1_front~0 0))))), Black: 1488#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1476#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1194#(<= 1 ~total~0), 457#true, Black: 1765#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 1758#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~q1~0.offset 0) (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_479) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 1470#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (< ~n1~0 1) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1326#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1464#(and (<= 1 ~total~0) (or (< ~n1~0 1) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1492#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (< ~n1~0 1) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1448#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (and (or (not (= ~q1_front~0 0)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)))) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (<= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (= ~total~0 0) (<= ~n1~0 ~q1_front~0)) (<= ~n1~0 2) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1318#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 1458#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1450#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 244#(and (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 242#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 246#(and (<= ~i~0 0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0) (<= (+ ~i~0 1) ~N~0)), 1520#true]) [2023-08-24 01:59:47,470 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-24 01:59:47,471 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:59:47,471 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:59:47,471 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 01:59:48,289 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([921] L99-->L96: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork0_plus_~a#1_5| |v_thread3Thread1of1ForFork0_plus_~b#1_5|))) (and (= v_~total~0_64 |v_thread3Thread1of1ForFork0_plus_#in~a#1_5|) (= (+ v_~q1_front~0_55 1) v_~q1_front~0_54) (= |v_thread3Thread1of1ForFork0_plus_#in~a#1_5| |v_thread3Thread1of1ForFork0_plus_~a#1_5|) (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_~b#1_5| 0) (<= .cse0 2147483647)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_63) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| .cse0) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_13| 256) 0)) (= |v_thread3Thread1of1ForFork0_plus_#in~b#1_5| |v_thread3Thread1of1ForFork0_plus_~b#1_5|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (= (select (select |v_#memory_int_103| v_~q1~0.base_27) (+ v_~q1~0.offset_27 (* 4 v_~q1_front~0_55))) |v_thread3Thread1of1ForFork0_plus_#in~b#1_5|) (not (= (ite (and (< v_~q1_front~0_55 v_~n1~0_24) (<= 0 v_~q1_front~0_55) (< v_~q1_front~0_55 v_~q1_back~0_63)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_27, ~q1_front~0=v_~q1_front~0_55, ~q1_back~0=v_~q1_back~0_63, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_103|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_64} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_27, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_54, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_5|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_5|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_63, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_63, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_103|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_5|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][359], [947#true, 1769#true, Black: 956#(or (< ~q1_back~0 (+ ~q1_front~0 1)) (and (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|)))), Black: 1179#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), 246#(and (<= ~i~0 0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0) (<= (+ ~i~0 1) ~N~0)), Black: 934#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (< 1 ~q1_front~0)) (<= 0 ~total~0) (or (<= ~n1~0 2) (<= ~q1_front~0 1)) (< 0 ~C~0) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0)), Black: 938#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (or (<= ~q1_back~0 2) (<= ~q1_front~0 1)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), Black: 740#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (< 0 ~C~0) (= ~q1_back~0 ~q1_front~0)), Black: 762#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 940#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|)), 12#L96true, Black: 678#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))) (or (< ~q1_front~0 0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0)) (forall ((v_ArrVal_191 (Array Int Int)) (~q1_front~0 Int) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1) (< 0 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), 711#true, Black: 690#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 686#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0))), Black: 692#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_194 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))), Black: 651#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 688#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_194 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))), Black: 602#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), 111#L150-1true, Black: 682#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0))), Black: 450#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 684#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((v_ArrVal_191 (Array Int Int)) (~q1_front~0 Int) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1) (< 0 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 432#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)), Black: 696#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 446#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 261#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1484#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1444#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (and (<= ~q1_front~0 0) (not (= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1478#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1446#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (and (<= ~q1_front~0 0) (not (= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), 448#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 1456#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1432#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0))), Black: 1472#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1436#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (and (or (not (= ~q1_front~0 0)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)))) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (<= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (= ~total~0 0) (<= ~n1~0 ~q1_front~0)) (<= ~n1~0 2)), Black: 1468#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1430#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~n1~0 1)) (<= ~n1~0 2)), Black: 1460#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|)))) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1474#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0))), Black: 1365#(or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 1452#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1192#(and (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= ~q1_front~0 0)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (<= ~q1_front~0 0))))), Black: 1488#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1476#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1194#(<= 1 ~total~0), 457#true, Black: 1765#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 1758#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~q1~0.offset 0) (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_479) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 1470#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (< ~n1~0 1) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1326#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1464#(and (<= 1 ~total~0) (or (< ~n1~0 1) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1492#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (< ~n1~0 1) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1448#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (and (or (not (= ~q1_front~0 0)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)))) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (<= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (= ~total~0 0) (<= ~n1~0 ~q1_front~0)) (<= ~n1~0 2) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1458#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1450#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 244#(and (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), 1318#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 242#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 64#thread4EXITtrue, 1520#true]) [2023-08-24 01:59:48,290 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-24 01:59:48,290 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-24 01:59:48,290 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 01:59:48,290 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 01:59:50,234 INFO L124 PetriNetUnfolderBase]: 189261/260382 cut-off events. [2023-08-24 01:59:50,234 INFO L125 PetriNetUnfolderBase]: For 3327655/3345156 co-relation queries the response was YES. [2023-08-24 01:59:52,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1412763 conditions, 260382 events. 189261/260382 cut-off events. For 3327655/3345156 co-relation queries the response was YES. Maximal size of possible extension queue 12227. Compared 2075720 event pairs, 100019 based on Foata normal form. 14133/250146 useless extension candidates. Maximal degree in co-relation 1395820. Up to 180883 conditions per place. [2023-08-24 01:59:53,992 INFO L140 encePairwiseOnDemand]: 455/460 looper letters, 803 selfloop transitions, 14 changer transitions 104/960 dead transitions. [2023-08-24 01:59:53,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 960 transitions, 15895 flow [2023-08-24 01:59:53,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 01:59:53,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 01:59:53,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 802 transitions. [2023-08-24 01:59:53,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4358695652173913 [2023-08-24 01:59:53,994 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 802 transitions. [2023-08-24 01:59:53,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 802 transitions. [2023-08-24 01:59:53,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:59:53,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 802 transitions. [2023-08-24 01:59:53,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 200.5) internal successors, (802), 4 states have internal predecessors, (802), 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-08-24 01:59:53,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 460.0) internal successors, (2300), 5 states have internal predecessors, (2300), 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-08-24 01:59:53,996 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 460.0) internal successors, (2300), 5 states have internal predecessors, (2300), 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-08-24 01:59:53,996 INFO L175 Difference]: Start difference. First operand has 197 places, 752 transitions, 10816 flow. Second operand 4 states and 802 transitions. [2023-08-24 01:59:53,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 960 transitions, 15895 flow [2023-08-24 02:02:04,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 960 transitions, 15251 flow, removed 63 selfloop flow, removed 10 redundant places. [2023-08-24 02:02:04,602 INFO L231 Difference]: Finished difference. Result has 192 places, 701 transitions, 9964 flow [2023-08-24 02:02:04,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=9627, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=9964, PETRI_PLACES=192, PETRI_TRANSITIONS=701} [2023-08-24 02:02:04,603 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 148 predicate places. [2023-08-24 02:02:04,603 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 701 transitions, 9964 flow [2023-08-24 02:02:04,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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-08-24 02:02:04,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:02:04,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:02:04,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 02:02:04,603 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 02:02:04,603 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:02:04,603 INFO L85 PathProgramCache]: Analyzing trace with hash 682936573, now seen corresponding path program 1 times [2023-08-24 02:02:04,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:02:04,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158731537] [2023-08-24 02:02:04,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:02:04,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:02:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:02:04,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 02:02:04,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:02:04,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158731537] [2023-08-24 02:02:04,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158731537] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:02:04,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790006909] [2023-08-24 02:02:04,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:02:04,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:02:04,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:02:04,746 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:02:04,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-24 02:02:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:02:04,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 02:02:04,876 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:02:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 02:02:04,901 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 02:02:04,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790006909] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 02:02:04,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 02:02:04,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-24 02:02:04,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767499451] [2023-08-24 02:02:04,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 02:02:04,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 02:02:04,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:02:04,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 02:02:04,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-24 02:02:04,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 460 [2023-08-24 02:02:04,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 701 transitions, 9964 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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-08-24 02:02:04,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:02:04,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 460 [2023-08-24 02:02:04,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:03:03,413 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([921] L99-->L96: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork0_plus_~a#1_5| |v_thread3Thread1of1ForFork0_plus_~b#1_5|))) (and (= v_~total~0_64 |v_thread3Thread1of1ForFork0_plus_#in~a#1_5|) (= (+ v_~q1_front~0_55 1) v_~q1_front~0_54) (= |v_thread3Thread1of1ForFork0_plus_#in~a#1_5| |v_thread3Thread1of1ForFork0_plus_~a#1_5|) (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_~b#1_5| 0) (<= .cse0 2147483647)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_63) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| .cse0) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_13| 256) 0)) (= |v_thread3Thread1of1ForFork0_plus_#in~b#1_5| |v_thread3Thread1of1ForFork0_plus_~b#1_5|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (= (select (select |v_#memory_int_103| v_~q1~0.base_27) (+ v_~q1~0.offset_27 (* 4 v_~q1_front~0_55))) |v_thread3Thread1of1ForFork0_plus_#in~b#1_5|) (not (= (ite (and (< v_~q1_front~0_55 v_~n1~0_24) (<= 0 v_~q1_front~0_55) (< v_~q1_front~0_55 v_~q1_back~0_63)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_27, ~q1_front~0=v_~q1_front~0_55, ~q1_back~0=v_~q1_back~0_63, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_103|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_64} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_27, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_54, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_5|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_5|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_63, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_63, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_103|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_5|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][399], [947#true, 1769#true, Black: 956#(or (< ~q1_back~0 (+ ~q1_front~0 1)) (and (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|)))), Black: 1179#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), 97#L149-2true, 246#(and (<= ~i~0 0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0) (<= (+ ~i~0 1) ~N~0)), Black: 934#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (< 1 ~q1_front~0)) (<= 0 ~total~0) (or (<= ~n1~0 2) (<= ~q1_front~0 1)) (< 0 ~C~0) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0)), Black: 938#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (or (<= ~q1_back~0 2) (<= ~q1_front~0 1)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), Black: 740#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (< 0 ~C~0) (= ~q1_back~0 ~q1_front~0)), Black: 762#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 940#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|)), 12#L96true, Black: 678#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))) (or (< ~q1_front~0 0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0)) (forall ((v_ArrVal_191 (Array Int Int)) (~q1_front~0 Int) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1) (< 0 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 690#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|))), 711#true, Black: 686#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0))), Black: 692#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_194 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))), Black: 651#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 688#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_194 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))), Black: 602#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 682#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0))), 1776#true, Black: 450#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 684#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((v_ArrVal_191 (Array Int Int)) (~q1_front~0 Int) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1) (< 0 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 696#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 432#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)), Black: 446#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 261#(<= (+ ~q1_front~0 1) ~q1_back~0), 192#L117true, Black: 1484#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1444#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (and (<= ~q1_front~0 0) (not (= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), 448#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 1446#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (and (<= ~q1_front~0 0) (not (= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1456#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1432#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0))), Black: 1472#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1436#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (and (or (not (= ~q1_front~0 0)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)))) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (<= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (= ~total~0 0) (<= ~n1~0 ~q1_front~0)) (<= ~n1~0 2)), Black: 1430#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~n1~0 1)) (<= ~n1~0 2)), Black: 1460#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|)))) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1474#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0))), Black: 1365#(or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 1452#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1192#(and (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= ~q1_front~0 0)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (<= ~q1_front~0 0))))), Black: 1488#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1476#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1765#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 1194#(<= 1 ~total~0), 457#true, Black: 1758#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~q1~0.offset 0) (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_479) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 1470#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (< ~n1~0 1) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1326#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1464#(and (<= 1 ~total~0) (or (< ~n1~0 1) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1492#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (< ~n1~0 1) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1448#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (and (or (not (= ~q1_front~0 0)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)))) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (<= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (= ~total~0 0) (<= ~n1~0 ~q1_front~0)) (<= ~n1~0 2) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1771#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1450#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1772#(<= ~n2~0 0), 1318#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 244#(and (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 242#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))]) [2023-08-24 02:03:03,413 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-24 02:03:03,413 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 02:03:03,413 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 02:03:03,413 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-24 02:03:06,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([921] L99-->L96: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork0_plus_~a#1_5| |v_thread3Thread1of1ForFork0_plus_~b#1_5|))) (and (= v_~total~0_64 |v_thread3Thread1of1ForFork0_plus_#in~a#1_5|) (= (+ v_~q1_front~0_55 1) v_~q1_front~0_54) (= |v_thread3Thread1of1ForFork0_plus_#in~a#1_5| |v_thread3Thread1of1ForFork0_plus_~a#1_5|) (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_~b#1_5| 0) (<= .cse0 2147483647)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_63) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| .cse0) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_13| 256) 0)) (= |v_thread3Thread1of1ForFork0_plus_#in~b#1_5| |v_thread3Thread1of1ForFork0_plus_~b#1_5|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (= (select (select |v_#memory_int_103| v_~q1~0.base_27) (+ v_~q1~0.offset_27 (* 4 v_~q1_front~0_55))) |v_thread3Thread1of1ForFork0_plus_#in~b#1_5|) (not (= (ite (and (< v_~q1_front~0_55 v_~n1~0_24) (<= 0 v_~q1_front~0_55) (< v_~q1_front~0_55 v_~q1_back~0_63)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_27, ~q1_front~0=v_~q1_front~0_55, ~q1_back~0=v_~q1_back~0_63, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_103|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_64} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_27, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_54, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_5|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_5|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_63, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_63, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_103|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_5|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][399], [947#true, 1769#true, Black: 956#(or (< ~q1_back~0 (+ ~q1_front~0 1)) (and (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|)))), Black: 1179#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), 97#L149-2true, 246#(and (<= ~i~0 0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0) (<= (+ ~i~0 1) ~N~0)), Black: 934#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (< 1 ~q1_front~0)) (<= 0 ~total~0) (or (<= ~n1~0 2) (<= ~q1_front~0 1)) (< 0 ~C~0) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0)), Black: 938#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (or (<= ~q1_back~0 2) (<= ~q1_front~0 1)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), Black: 740#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (< 0 ~C~0) (= ~q1_back~0 ~q1_front~0)), Black: 762#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 940#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|)), 12#L96true, Black: 678#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))) (or (< ~q1_front~0 0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0)) (forall ((v_ArrVal_191 (Array Int Int)) (~q1_front~0 Int) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1) (< 0 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 690#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|))), 711#true, Black: 686#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0))), Black: 692#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_194 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))), Black: 651#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 688#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_194 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))), Black: 602#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 682#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0))), 1776#true, Black: 450#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 684#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((v_ArrVal_191 (Array Int Int)) (~q1_front~0 Int) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1) (< 0 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 696#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 432#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)), Black: 446#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 261#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1484#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1444#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (and (<= ~q1_front~0 0) (not (= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), 448#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 1446#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (and (<= ~q1_front~0 0) (not (= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1456#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1432#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0))), Black: 1472#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1436#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (and (or (not (= ~q1_front~0 0)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)))) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (<= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (= ~total~0 0) (<= ~n1~0 ~q1_front~0)) (<= ~n1~0 2)), Black: 1430#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~n1~0 1)) (<= ~n1~0 2)), Black: 1460#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|)))) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1474#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0))), Black: 1365#(or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 1452#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1192#(and (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= ~q1_front~0 0)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (<= ~q1_front~0 0))))), Black: 1488#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1476#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), 457#true, Black: 1765#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 1194#(<= 1 ~total~0), Black: 1470#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (< ~n1~0 1) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1758#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~q1~0.offset 0) (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_479) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 1326#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1464#(and (<= 1 ~total~0) (or (< ~n1~0 1) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1492#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (< ~n1~0 1) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1448#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (and (or (not (= ~q1_front~0 0)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)))) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (<= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (= ~total~0 0) (<= ~n1~0 ~q1_front~0)) (<= ~n1~0 2) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1771#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1450#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1772#(<= ~n2~0 0), 1318#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 244#(and (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 242#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 64#thread4EXITtrue]) [2023-08-24 02:03:06,964 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-24 02:03:06,964 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 02:03:06,965 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 02:03:06,966 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 02:03:06,968 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([921] L99-->L96: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork0_plus_~a#1_5| |v_thread3Thread1of1ForFork0_plus_~b#1_5|))) (and (= v_~total~0_64 |v_thread3Thread1of1ForFork0_plus_#in~a#1_5|) (= (+ v_~q1_front~0_55 1) v_~q1_front~0_54) (= |v_thread3Thread1of1ForFork0_plus_#in~a#1_5| |v_thread3Thread1of1ForFork0_plus_~a#1_5|) (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_~b#1_5| 0) (<= .cse0 2147483647)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_63) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| .cse0) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_13| 256) 0)) (= |v_thread3Thread1of1ForFork0_plus_#in~b#1_5| |v_thread3Thread1of1ForFork0_plus_~b#1_5|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (= (select (select |v_#memory_int_103| v_~q1~0.base_27) (+ v_~q1~0.offset_27 (* 4 v_~q1_front~0_55))) |v_thread3Thread1of1ForFork0_plus_#in~b#1_5|) (not (= (ite (and (< v_~q1_front~0_55 v_~n1~0_24) (<= 0 v_~q1_front~0_55) (< v_~q1_front~0_55 v_~q1_back~0_63)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_27, ~q1_front~0=v_~q1_front~0_55, ~q1_back~0=v_~q1_back~0_63, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_103|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_64} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_27, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_54, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_5|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_5|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_63, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_63, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_103|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_5|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][399], [947#true, 1769#true, Black: 956#(or (< ~q1_back~0 (+ ~q1_front~0 1)) (and (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|)))), Black: 1179#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), 246#(and (<= ~i~0 0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0) (<= (+ ~i~0 1) ~N~0)), Black: 934#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (< 1 ~q1_front~0)) (<= 0 ~total~0) (or (<= ~n1~0 2) (<= ~q1_front~0 1)) (< 0 ~C~0) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0)), Black: 938#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (or (<= ~q1_back~0 2) (<= ~q1_front~0 1)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), Black: 740#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (< 0 ~C~0) (= ~q1_back~0 ~q1_front~0)), Black: 762#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 940#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|)), 12#L96true, Black: 678#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))) (or (< ~q1_front~0 0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0)) (forall ((v_ArrVal_191 (Array Int Int)) (~q1_front~0 Int) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1) (< 0 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 690#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|))), 711#true, Black: 686#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0))), Black: 692#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_194 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))), Black: 651#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 688#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_194 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))), Black: 602#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), 111#L150-1true, Black: 682#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0))), 1776#true, Black: 450#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 684#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((v_ArrVal_191 (Array Int Int)) (~q1_front~0 Int) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1) (< 0 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 696#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 432#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)), Black: 446#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 261#(<= (+ ~q1_front~0 1) ~q1_back~0), 192#L117true, Black: 1484#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1444#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (and (<= ~q1_front~0 0) (not (= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1446#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (and (<= ~q1_front~0 0) (not (= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), 448#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 1456#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1432#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0))), Black: 1472#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1436#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (and (or (not (= ~q1_front~0 0)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)))) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (<= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (= ~total~0 0) (<= ~n1~0 ~q1_front~0)) (<= ~n1~0 2)), Black: 1430#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~n1~0 1)) (<= ~n1~0 2)), Black: 1460#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|)))) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1474#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0))), Black: 1365#(or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 1452#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1192#(and (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= ~q1_front~0 0)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (<= ~q1_front~0 0))))), Black: 1488#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1476#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1765#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), 457#true, Black: 1194#(<= 1 ~total~0), Black: 1758#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~q1~0.offset 0) (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_479) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 1470#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (< ~n1~0 1) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1326#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1464#(and (<= 1 ~total~0) (or (< ~n1~0 1) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1492#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (< ~n1~0 1) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1448#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (and (or (not (= ~q1_front~0 0)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)))) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (<= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (= ~total~0 0) (<= ~n1~0 ~q1_front~0)) (<= ~n1~0 2) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1771#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1450#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1772#(<= ~n2~0 0), 1318#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 244#(and (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 242#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))]) [2023-08-24 02:03:06,968 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-24 02:03:06,968 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 02:03:06,968 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 02:03:06,968 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 02:03:08,993 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([921] L99-->L96: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork0_plus_~a#1_5| |v_thread3Thread1of1ForFork0_plus_~b#1_5|))) (and (= v_~total~0_64 |v_thread3Thread1of1ForFork0_plus_#in~a#1_5|) (= (+ v_~q1_front~0_55 1) v_~q1_front~0_54) (= |v_thread3Thread1of1ForFork0_plus_#in~a#1_5| |v_thread3Thread1of1ForFork0_plus_~a#1_5|) (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_~b#1_5| 0) (<= .cse0 2147483647)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_63) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| .cse0) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_13| 256) 0)) (= |v_thread3Thread1of1ForFork0_plus_#in~b#1_5| |v_thread3Thread1of1ForFork0_plus_~b#1_5|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (= (select (select |v_#memory_int_103| v_~q1~0.base_27) (+ v_~q1~0.offset_27 (* 4 v_~q1_front~0_55))) |v_thread3Thread1of1ForFork0_plus_#in~b#1_5|) (not (= (ite (and (< v_~q1_front~0_55 v_~n1~0_24) (<= 0 v_~q1_front~0_55) (< v_~q1_front~0_55 v_~q1_back~0_63)) 1 0) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_27, ~q1_front~0=v_~q1_front~0_55, ~q1_back~0=v_~q1_back~0_63, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_103|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_64} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_27, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_54, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_5|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_5|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_63, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_63, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_103|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_5|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][399], [947#true, 1769#true, Black: 956#(or (< ~q1_back~0 (+ ~q1_front~0 1)) (and (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|)))), Black: 1179#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), 246#(and (<= ~i~0 0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0) (<= (+ ~i~0 1) ~N~0)), Black: 934#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (< 1 ~q1_front~0)) (<= 0 ~total~0) (or (<= ~n1~0 2) (<= ~q1_front~0 1)) (< 0 ~C~0) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0)), Black: 938#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (or (<= ~q1_back~0 2) (<= ~q1_front~0 1)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), Black: 740#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (< 0 ~C~0) (= ~q1_back~0 ~q1_front~0)), Black: 762#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 940#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|)), 12#L96true, Black: 678#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))) (or (< ~q1_front~0 0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0)) (forall ((v_ArrVal_191 (Array Int Int)) (~q1_front~0 Int) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1) (< 0 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 690#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|))), 711#true, Black: 686#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0))), Black: 692#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_194 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))), Black: 651#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 688#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (forall ((v_ArrVal_194 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))), 111#L150-1true, Black: 602#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 682#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~q1_front~0 0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0))) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0))), 1776#true, Black: 450#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 684#(and (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((v_ArrVal_191 (Array Int Int)) (~q1_front~0 Int) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1) (< 0 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_194) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 696#(and (<= 1 ~total~0) (or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 432#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)), Black: 446#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 261#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1484#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1444#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (and (<= ~q1_front~0 0) (not (= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), Black: 1446#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (and (<= ~q1_front~0 0) (not (= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2)), 448#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (<= ~N~0 ~i~0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 1456#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1432#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0))), Black: 1472#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 2)), Black: 1436#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (and (or (not (= ~q1_front~0 0)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)))) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (<= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (= ~total~0 0) (<= ~n1~0 ~q1_front~0)) (<= ~n1~0 2)), Black: 1430#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4)))) (<= 1 ~N~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~n1~0 1)) (<= ~n1~0 2)), Black: 1460#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|)))) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1474#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0))), Black: 1365#(or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)), Black: 1452#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1192#(and (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (or (not (= ~q1_front~0 0)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (<= ~q1_front~0 0))))), Black: 1488#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0) (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (or (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_404) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ ~q1_front~0 1) ~q1_back~0)) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1476#(and (<= 1 ~total~0) (<= ~q1_front~0 ~q1_back~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~q1_back~0 2) (<= ~n1~0 2) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), Black: 1194#(<= 1 ~total~0), 457#true, Black: 1765#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 1470#(and (<= 1 ~total~0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (< ~n1~0 1) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1758#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~q1~0.offset 0) (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_477) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_478) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_479) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 1326#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 1464#(and (<= 1 ~total~0) (or (< ~n1~0 1) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1492#(and (<= 1 ~total~0) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (= |thread3Thread1of1ForFork0_~cond~2#1| 0)) (or (< ~n1~0 1) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1448#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (and (or (not (= ~q1_front~0 0)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) 0)))) (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (* ~q1_front~0 4)))) (<= ~q1_front~0 0)))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (= ~total~0 0) (<= ~n1~0 ~q1_front~0)) (<= ~n1~0 2) (or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)))), Black: 1771#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1450#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_front~0 ~q1_back~0) (and (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 (+ ~total~0 ~C~0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))))), Black: 1772#(<= ~n2~0 0), Black: 244#(and (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), 1318#(or (<= 1 ~total~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 242#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 64#thread4EXITtrue]) [2023-08-24 02:03:08,993 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-24 02:03:08,993 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 02:03:08,993 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 02:03:08,993 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 02:03:11,695 INFO L124 PetriNetUnfolderBase]: 265632/364077 cut-off events. [2023-08-24 02:03:11,695 INFO L125 PetriNetUnfolderBase]: For 4978917/5009321 co-relation queries the response was YES. [2023-08-24 02:03:15,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1874294 conditions, 364077 events. 265632/364077 cut-off events. For 4978917/5009321 co-relation queries the response was YES. Maximal size of possible extension queue 14994. Compared 2872352 event pairs, 79615 based on Foata normal form. 18909/378529 useless extension candidates. Maximal degree in co-relation 1855909. Up to 202500 conditions per place. [2023-08-24 02:03:16,737 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 940 selfloop transitions, 12 changer transitions 0/989 dead transitions. [2023-08-24 02:03:16,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 989 transitions, 16315 flow [2023-08-24 02:03:16,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 02:03:16,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 02:03:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 674 transitions. [2023-08-24 02:03:16,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48840579710144927 [2023-08-24 02:03:16,739 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 674 transitions. [2023-08-24 02:03:16,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 674 transitions. [2023-08-24 02:03:16,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:03:16,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 674 transitions. [2023-08-24 02:03:16,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 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-08-24 02:03:16,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 460.0) internal successors, (1840), 4 states have internal predecessors, (1840), 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-08-24 02:03:16,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 460.0) internal successors, (1840), 4 states have internal predecessors, (1840), 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-08-24 02:03:16,741 INFO L175 Difference]: Start difference. First operand has 192 places, 701 transitions, 9964 flow. Second operand 3 states and 674 transitions. [2023-08-24 02:03:16,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 989 transitions, 16315 flow [2023-08-24 02:06:04,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 989 transitions, 16301 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-24 02:06:04,604 INFO L231 Difference]: Finished difference. Result has 194 places, 703 transitions, 10355 flow [2023-08-24 02:06:04,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=9950, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=689, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=10355, PETRI_PLACES=194, PETRI_TRANSITIONS=703} [2023-08-24 02:06:04,604 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 150 predicate places. [2023-08-24 02:06:04,605 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 703 transitions, 10355 flow [2023-08-24 02:06:04,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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-08-24 02:06:04,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:06:04,605 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:06:04,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-24 02:06:04,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:06:04,810 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 02:06:04,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:06:04,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1057733575, now seen corresponding path program 6 times [2023-08-24 02:06:04,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:06:04,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206536845] [2023-08-24 02:06:04,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:06:04,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:06:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:06:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:06:04,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:06:04,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206536845] [2023-08-24 02:06:04,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206536845] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:06:04,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303112042] [2023-08-24 02:06:04,927 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 02:06:04,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:06:04,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:06:04,927 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:06:04,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-24 02:06:05,117 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-24 02:06:05,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:06:05,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 02:06:05,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:06:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:06:05,144 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:06:05,200 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:06:05,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303112042] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:06:05,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:06:05,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-08-24 02:06:05,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077261931] [2023-08-24 02:06:05,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:06:05,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-24 02:06:05,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:06:05,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-24 02:06:05,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2023-08-24 02:06:05,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 460 [2023-08-24 02:06:05,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 703 transitions, 10355 flow. Second operand has 9 states, 9 states have (on average 195.44444444444446) internal successors, (1759), 9 states have internal predecessors, (1759), 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-08-24 02:06:05,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:06:05,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 460 [2023-08-24 02:06:05,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:07:41,514 INFO L124 PetriNetUnfolderBase]: 431526/586911 cut-off events. [2023-08-24 02:07:41,514 INFO L125 PetriNetUnfolderBase]: For 6093688/6093688 co-relation queries the response was YES. [2023-08-24 02:07:47,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2942300 conditions, 586911 events. 431526/586911 cut-off events. For 6093688/6093688 co-relation queries the response was YES. Maximal size of possible extension queue 16065. Compared 4446059 event pairs, 106809 based on Foata normal form. 4130/591041 useless extension candidates. Maximal degree in co-relation 2941915. Up to 358060 conditions per place. [2023-08-24 02:07:49,624 INFO L140 encePairwiseOnDemand]: 456/460 looper letters, 691 selfloop transitions, 150 changer transitions 5/846 dead transitions. [2023-08-24 02:07:49,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 846 transitions, 13647 flow [2023-08-24 02:07:49,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 02:07:49,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 02:07:49,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1060 transitions. [2023-08-24 02:07:49,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4608695652173913 [2023-08-24 02:07:49,626 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1060 transitions. [2023-08-24 02:07:49,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1060 transitions. [2023-08-24 02:07:49,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:07:49,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1060 transitions. [2023-08-24 02:07:49,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 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-08-24 02:07:49,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 460.0) internal successors, (2760), 6 states have internal predecessors, (2760), 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-08-24 02:07:49,642 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 460.0) internal successors, (2760), 6 states have internal predecessors, (2760), 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-08-24 02:07:49,642 INFO L175 Difference]: Start difference. First operand has 194 places, 703 transitions, 10355 flow. Second operand 5 states and 1060 transitions. [2023-08-24 02:07:49,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 846 transitions, 13647 flow Received shutdown request... [2023-08-24 02:08:01,331 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 02:08:01,350 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 02:08:01,371 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-24 02:08:01,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-24 02:08:01,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-24 02:08:01,579 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2023-08-24 02:08:01,580 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-08-24 02:08:01,580 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-24 02:08:01,580 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-24 02:08:01,580 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-08-24 02:08:01,580 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2023-08-24 02:08:01,595 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 02:08:01,595 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 02:08:01,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 02:08:01 BasicIcfg [2023-08-24 02:08:01,596 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 02:08:01,597 INFO L158 Benchmark]: Toolchain (without parser) took 747185.24ms. Allocated memory was 375.4MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 352.5MB in the beginning and 8.1GB in the end (delta: -7.8GB). Peak memory consumption was 9.4GB. Max. memory is 16.0GB. [2023-08-24 02:08:01,597 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 375.4MB. Free memory is still 351.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 02:08:01,597 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.61ms. Allocated memory is still 375.4MB. Free memory was 352.5MB in the beginning and 339.1MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-24 02:08:01,597 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.90ms. Allocated memory is still 375.4MB. Free memory was 339.1MB in the beginning and 337.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 02:08:01,597 INFO L158 Benchmark]: Boogie Preprocessor took 35.25ms. Allocated memory is still 375.4MB. Free memory was 337.0MB in the beginning and 334.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 02:08:01,597 INFO L158 Benchmark]: RCFGBuilder took 711.12ms. Allocated memory is still 375.4MB. Free memory was 334.4MB in the beginning and 287.5MB in the end (delta: 46.9MB). Peak memory consumption was 48.2MB. Max. memory is 16.0GB. [2023-08-24 02:08:01,598 INFO L158 Benchmark]: TraceAbstraction took 746140.17ms. Allocated memory was 375.4MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 286.7MB in the beginning and 8.1GB in the end (delta: -7.8GB). Peak memory consumption was 9.3GB. Max. memory is 16.0GB. [2023-08-24 02:08:01,598 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.11ms. Allocated memory is still 375.4MB. Free memory is still 351.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 238.61ms. Allocated memory is still 375.4MB. Free memory was 352.5MB in the beginning and 339.1MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 55.90ms. Allocated memory is still 375.4MB. Free memory was 339.1MB in the beginning and 337.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.25ms. Allocated memory is still 375.4MB. Free memory was 337.0MB in the beginning and 334.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 711.12ms. Allocated memory is still 375.4MB. Free memory was 334.4MB in the beginning and 287.5MB in the end (delta: 46.9MB). Peak memory consumption was 48.2MB. Max. memory is 16.0GB. * TraceAbstraction took 746140.17ms. Allocated memory was 375.4MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 286.7MB in the beginning and 8.1GB in the end (delta: -7.8GB). Peak memory consumption was 9.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.3s, 219 PlacesBefore, 44 PlacesAfterwards, 225 TransitionsBefore, 37 TransitionsAfterwards, 2000 CoEnabledTransitionPairs, 8 FixpointIterations, 145 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 8 ConcurrentYvCompositions, 13 ChoiceCompositions, 219 TotalNumberOfCompositions, 4193 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2863, independent: 2766, independent conditional: 0, independent unconditional: 2766, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1057, independent: 1035, independent conditional: 0, independent unconditional: 1035, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2863, independent: 1731, independent conditional: 0, independent unconditional: 1731, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 1057, unknown conditional: 0, unknown unconditional: 1057] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 158, Positive conditional cache size: 0, Positive unconditional cache size: 158, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 146]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 147]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 145]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 144]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 257 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 746.0s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 721.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.5s, HoareTripleCheckerStatistics: 128 mSolverCounterUnknown, 2654 SdHoareTripleChecker+Valid, 11.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2654 mSDsluCounter, 108 SdHoareTripleChecker+Invalid, 11.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 302 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 205 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7645 IncrementalHoareTripleChecker+Invalid, 8280 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 205 mSolverCounterUnsat, 10 mSDtfsCounter, 7645 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 647 GetRequests, 402 SyntacticMatches, 9 SemanticMatches, 236 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 2101 ImplicationChecksByTransitivity, 17.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10816occurred in iteration=8, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 622 NumberOfCodeBlocks, 622 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 827 ConstructedInterpolants, 35 QuantifiedInterpolants, 11080 SizeOfPredicates, 179 NumberOfNonLiveVariables, 2960 ConjunctsInSsa, 202 ConjunctsInUnsatCore, 26 InterpolantComputations, 5 PerfectInterpolantSequences, 67/132 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown [2023-08-24 02:08:01,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 !ENTRY org.eclipse.osgi 4 0 2023-08-24 02:08:01.859 !MESSAGE Application error !STACK 1 org.eclipse.core.internal.resources.ResourceException(/)[568]: java.io.FileNotFoundException: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13eb35bed/.metadata/.plugins/org.eclipse.core.resources/.root/1.tree (No such file or directory) at java.base/java.io.FileOutputStream.open0(Native Method) at java.base/java.io.FileOutputStream.open(FileOutputStream.java:298) at java.base/java.io.FileOutputStream.(FileOutputStream.java:237) at java.base/java.io.FileOutputStream.(FileOutputStream.java:187) at org.eclipse.core.internal.localstore.SafeFileOutputStream.(SafeFileOutputStream.java:55) at org.eclipse.core.internal.resources.SaveManager.saveTree(SaveManager.java:1381) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1168) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2333) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2322) at de.uni_freiburg.informatik.ultimate.core.coreplugin.UltimateCore.start(UltimateCore.java:190) at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.base/java.lang.reflect.Method.invoke(Method.java:566) at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:657) at org.eclipse.equinox.launcher.Main.basicRun(Main.java:594) at org.eclipse.equinox.launcher.Main.run(Main.java:1465) at org.eclipse.equinox.launcher.Main.main(Main.java:1438) An error has occurred. See the log file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13eb35bed/.metadata/.log.